Struct traitgraph::algo::dijkstra::Dijkstra [−][src]
pub struct Dijkstra<Graph: GraphBase, NodeWeights> { /* fields omitted */ }
Expand description
Data structure for Dijkstra’s shortest path algorithm.
This variant of Dijkstra’s algorithm supports only computing the length of a shortest path, and not the shortest path itself. Therefore it does not need an array of back pointers for each node, saving a bit of memory.
Implementations
impl<EdgeData: WeightedEdgeData, Graph: StaticGraph<EdgeData = EdgeData>, NodeWeights: NodeWeightArray<usize>> Dijkstra<Graph, NodeWeights>
impl<EdgeData: WeightedEdgeData, Graph: StaticGraph<EdgeData = EdgeData>, NodeWeights: NodeWeightArray<usize>> Dijkstra<Graph, NodeWeights>
Compute the shortest paths from source to all targets, with given maximum weight.