Module traitgraph_algo::dijkstra

Dijkstra’s shortest path algorithm.

Modules

epoch_array_dijkstra_node_weight_array

Using an epoched array as NodeWeightArray.

performance_counters

Performance counters for Dijkstra’s algorithm.

Structs

Dijkstra

Data structure for Dijkstra’s shortest path algorithm.

DijkstraStatus

The final status of an execution of Dijkstra’s algorithm.

Enums

DijkstraExhaustiveness

The exhaustiveness of an execution of Dijkstra’s algorithm. This can be complete, or partial because of reaching performance limits.

Traits

DijkstraHeap

A min-heap used in Dijkstra’s shortest path algorithm.

DijkstraTargetMap

A data structure that decides whether a given node index is a target of the current Dijkstra search.

DijkstraWeight

A weight-type usable in Dijkstra’s algorithm.

DijkstraWeightedEdgeData

Edge data that has a weight usable for shortest path computation.

NodeWeightArray

An array to store minimal node weights for Dijkstra’s algorithm.

Type Definitions

DefaultDijkstra

A Dijkstra implementation with a set of common optimisations.