Enum traitgraph_algo::dijkstra::DijkstraExhaustiveness

source · [−]

pub enum DijkstraExhaustiveness {
    Complete,
    PartialNodeWeights,
    PartialHeap,
}

Expand description

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

source

impl Clone for DijkstraExhaustiveness

source

fn clone(&self) -> DijkstraExhaustiveness

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl Debug for DijkstraExhaustiveness

source

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

Formats the value using the given formatter. Read more

source

impl PartialEq<DijkstraExhaustiveness> for DijkstraExhaustiveness

source

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

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

1.0.0 · source

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

This method tests for !=.

source

impl Eq for DijkstraExhaustiveness

source

impl StructuralEq for DijkstraExhaustiveness

source

impl StructuralPartialEq for DijkstraExhaustiveness

Auto Trait Implementations

impl RefUnwindSafe for DijkstraExhaustiveness

impl Send for DijkstraExhaustiveness

impl Sync for DijkstraExhaustiveness

impl Unpin for DijkstraExhaustiveness

impl UnwindSafe for DijkstraExhaustiveness

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

Enum traitgraph_algo::dijkstra::DijkstraExhaustiveness

Variants

Complete

PartialNodeWeights

PartialHeap

Trait Implementations

impl Clone for DijkstraExhaustiveness

fn clone(&self) -> DijkstraExhaustiveness

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

impl Debug for DijkstraExhaustiveness

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

impl PartialEq<DijkstraExhaustiveness> for DijkstraExhaustiveness

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

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

impl Eq for DijkstraExhaustiveness

impl StructuralEq for DijkstraExhaustiveness

impl StructuralPartialEq for DijkstraExhaustiveness

Auto Trait Implementations

impl RefUnwindSafe for DijkstraExhaustiveness

impl Send for DijkstraExhaustiveness

impl Sync for DijkstraExhaustiveness

impl Unpin for DijkstraExhaustiveness

impl UnwindSafe for DijkstraExhaustiveness

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<Q, K> Equivalent<K> for Q where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T> ToOwned for T where T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<V, T> VZip<V> for T where V: MultiLane<T>,

fn vzip(self) -> V

`Complete`

`PartialNodeWeights`

`PartialHeap`

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<V, T> VZip<V> for T where
V: MultiLane<T>,