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.

Trait Implementations

impl Clone for DijkstraExhaustiveness

fn clone(&self) -> DijkstraExhaustiveness

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DijkstraExhaustiveness

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq<DijkstraExhaustiveness> for DijkstraExhaustiveness

fn eq(&self, other: &DijkstraExhaustiveness) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for DijkstraExhaustiveness

impl StructuralEq for DijkstraExhaustiveness

impl StructuralPartialEq for DijkstraExhaustiveness