import { type GraphInstance, type RouteLine, type RoutePoint, type ShortestPathResult } from "../types";
/** Computes the weighted path cost matching the graph link distance formula. */
export declare function computeWeightedPathCost(points: RoutePoint[], lines: RouteLine[]): number;
/**
 * Finds the shortest path between candidate point sets by trying all from×to
 * pairs and picking the one with the lowest weighted cost.
 *
 * Complexity is O(N×M × A*) where N = |from|, M = |to|. In practice N, M ≤ 5
 * (rect-based booth candidates) or = 1 (nearest-point fallback), so the brute
 * force approach is acceptable. Multi-source A* would reduce this to a single
 * traversal but adds significant implementation complexity.
 */
export declare function findShortestPath(graph: GraphInstance, from: RoutePoint[], to: RoutePoint[]): ShortestPathResult | null;
//# sourceMappingURL=findShortestPath.d.ts.map