Expand description
Dijkstra’s shortest path algorithm implementation. Dijkstra’s shortest path algorithm implementation.
Structs§
- Dijkstra
Result - Result of Dijkstra’s shortest path algorithm.
Functions§
- dijkstra
- [Generic] Compute shortest paths from node
sourceto all other nodes using Dijkstra’s algorithm. - dijkstra_
path - [Generic] Compute shortest path from
sourcetotargetusing Dijkstra’s algorithm.