Enum traitgraph_algo::dijkstra::DijkstraExhaustiveness

pub enum DijkstraExhaustiveness {
    Complete,
    PartialNodeWeights,
    PartialHeap,
}

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

Note that the max_weight parameter is not a performance limit, but a limit on the search space.

Variants

Complete

The search exhausted the search space.

PartialNodeWeights

The search was aborted early because the node weight data structure grew too large.

PartialHeap

The search was aborted early because the heap grew too large.