import { GraphNode, WeightedGraph } from '../graph-node';
/**
 * Perform Dijkstra's shortest path algorithm.
 * Find the shortest path between two vertices in a directed graph with positive weights.
 *
 * Time complexity: O[(V+E)logV]
 * Space complexity: O(V+E)
 *
 * @param {WeightedGraph<T>} graph
 * @param {GraphNode<T>} source
 * @param {GraphNode<T>} target
 * @return {[Array<<T>>, number]}
 */
export declare const shortestPath: <T>(graph: WeightedGraph<T>, source: GraphNode<T>, target: GraphNode<T>) => [T[], number];
//# sourceMappingURL=dijkstras-shortest-path.d.ts.map