graph/dijkstra_utils library
Dijkstra shortest path on weighted graphs (roadmap #533).
Functions
-
dijkstraDistances(
WeightedAdjacency graph, int source) → List< double> -
Returns shortest distances from
sourceto all nodes; unreachable = infinity. -
dijkstraWithParents(
WeightedAdjacency graph, int source) → (List< double> , List<int?> ) - Returns (distances, parent array). The parent list entry at index i is the predecessor on shortest path from source.