import { RankedPath } from '../../../algorithms/pathfinding/path-ranking';
import { Path } from '../../../algorithms/types/algorithm-results';
import { Edge, Node } from '../../../algorithms/types/graph';
/**
 * Rank paths by length (shortest first).
 * Standard baseline for path finding.
 *
 * @param paths - Paths to rank
 * @returns Paths sorted by length (ascending)
 */
export declare const shortestPathRanker: <N extends Node, E extends Edge>(paths: Path<N, E>[]) => RankedPath<N, E>[];
//# sourceMappingURL=shortest-path-ranker.d.ts.map