Module traitgraph_algo::dijkstra
source · [−]Expand description
Dijkstra’s shortest path algorithm.
Modules
Using an epoched array as NodeWeightArray.
Structs
Data structure for Dijkstra’s shortest path algorithm.
Traits
A min-heap used in Dijkstra’s shortest path algorithm.
A data structure that decides whether a given node index is a target of the current Dijkstra search.
A weight-type usable in Dijkstra’s algorithm.
Edge data that has a weight usable for shortest path computation.
An array to store minimal node weights for Dijkstra’s algorithm.
Type Definitions
A Dijkstra implementation with a set of common optimisations.