/**
 * Result type for shortest path calculation
 */
export interface ShortestPathResult {
    path: string[];
    distance: number;
}
/**
 * Finds the shortest path between two nodes in a weighted graph using Dijkstra's algorithm.
 *
 * @param graph - Weighted graph as adjacency list Map<node, Map<neighbor, weight>>
 * @param start - Starting node
 * @param end - Target node
 * @returns ShortestPathResult with path and distance, or null if no path exists
 */
export declare function findShortestPath(graph: Map<string, Map<string, number>>, start: string, end: string): ShortestPathResult | null;
//# sourceMappingURL=dijkstra.d.ts.map