Expand description
Dijkstra’s shortest path algorithm implementation.
Provides functions for single-source shortest path computation.
Functions§
- dijkstra
- Computes shortest distances from start node to all reachable nodes.
- dijkstra_
path - Computes the shortest path from start to end node.
- dijkstra_
with_ predecessors - Computes shortest distances and predecessor map for path reconstruction.