import { Result } from '../../algorithms/types/result.js';
import { BenchmarkGraphExpander } from '../evaluation/__tests__/validation/common/benchmark-graph-expander.js';
/**
 * Configuration for Shortest Path Ranking SUT.
 */
export interface ShortestRankingConfig {
    /** Maximum number of paths to return */
    maxPaths?: number;
}
/**
 * Shortest ranking result.
 */
export interface ShortestRankingResult {
    pathsFound: number;
    meanLength: number;
    meanMI: number;
    stdMI: number;
    pathDiversity: number;
    hubAvoidance: number;
    nodeCoverage: number;
    meanScore: number;
    stdScore: number;
    paths: Array<{
        id: string;
        nodes: string[];
        length: number;
    }>;
}
/**
 * Shortest Path Ranking SUT (conventional baseline).
 *
 * Ranks paths between source and target nodes by length (shortest first).
 */
export declare class ShortestRankingSUT {
    readonly id = "shortest-ranking-v1.0.0";
    readonly config: Readonly<Record<string, unknown>>;
    private readonly expander;
    private readonly source;
    private readonly target;
    private readonly rankingConfig;
    constructor(expander: BenchmarkGraphExpander, inputs: readonly string[], config?: ShortestRankingConfig);
    /**
     * Execute shortest path ranking.
     */
    run(): Promise<Result<ShortestRankingResult, Error>>;
    /**
     * Create an empty result (no paths found).
     */
    private createEmptyResult;
}
//# sourceMappingURL=shortest-ranking-sut.d.ts.map