import { Graph } from '../../algorithms/graph/graph';
import { RankedPath } from '../../algorithms/pathfinding/path-ranking';
import { Edge, Node } from '../../algorithms/types/graph';
import { Option } from '../../algorithms/types/option';
import { Result } from '../../algorithms/types/result';
/**
 * Configuration for shortest path ranking.
 */
export interface ShortestPathConfig {
    /**
     * Traversal mode for path finding.
     */
    traversalMode?: "directed" | "undirected";
    /**
     * Maximum number of paths to return.
     */
    maxPaths?: number;
}
/**
 * Rank paths between two nodes by shortest path length.
 *
 * This baseline ranks paths purely by their length, with shorter paths
 * receiving higher scores. The score is computed as 1/(length + 1).
 *
 * Time Complexity: O(V + E) for BFS
 * Space Complexity: O(V + E) for predecessor tracking
 *
 * @template N - Node type
 * @template E - Edge type
 * @param graph - The graph to search
 * @param startId - Source node ID
 * @param endId - Target node ID
 * @param config - Optional configuration
 * @returns Result containing ranked paths or error
 */
export declare const shortestPathRanking: <N extends Node, E extends Edge>(graph: Graph<N, E>, startId: string, endId: string, config?: ShortestPathConfig) => Result<Option<RankedPath<N, E>[]>, {
    type: string;
    message: string;
}>;
//# sourceMappingURL=shortest-path-ranking.d.ts.map