import { Graph } from '../graph/graph.js';
import { GraphError } from '../types/errors.js';
import { Edge, Node } from '../types/graph.js';
import { Result } from '../types/result.js';
import { RankedPath } from './path-ranking.js';
/**
 * Configuration for shortest path ranking.
 */
export interface ShortestPathRankingConfig {
    /** Maximum number of paths to find */
    maxPaths?: number;
}
/**
 * Find k-shortest paths between source and target.
 *
 * Uses a modified Dijkstra approach: finds shortest path, then iteratively
 * finds next-shortest paths by removing edges from previously found paths.
 *
 * Note: This is a simplified k-shortest paths implementation. For production,
 * consider Yen's algorithm or Eppstein's algorithm for better performance.
 * @param graph - The graph to search
 * @param sourceId - Starting node ID
 * @param targetId - Ending node ID
 * @param config - Configuration for pathfinding
 * @returns Result containing array of ranked paths or error
 */
export declare const shortestPathRanking: <N extends Node, E extends Edge>(graph: Graph<N, E>, sourceId: string, targetId: string, config?: ShortestPathRankingConfig) => Result<Array<RankedPath<N, E>>, GraphError>;
//# sourceMappingURL=shortest-path-ranking.d.ts.map