Struct graphalgs::shortest_path::NegativeCycle
source · pub struct NegativeCycle {}
Expand description
An algorithm error: a cycle of negative weights was found in the graph.
Trait Implementations§
source§impl Clone for NegativeCycle
impl Clone for NegativeCycle
source§fn clone(&self) -> NegativeCycle
fn clone(&self) -> NegativeCycle
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl Debug for NegativeCycle
impl Debug for NegativeCycle
source§impl PartialEq<NegativeCycle> for NegativeCycle
impl PartialEq<NegativeCycle> for NegativeCycle
source§fn eq(&self, other: &NegativeCycle) -> bool
fn eq(&self, other: &NegativeCycle) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.impl Eq for NegativeCycle
impl StructuralEq for NegativeCycle
impl StructuralPartialEq for NegativeCycle
Auto Trait Implementations§
impl RefUnwindSafe for NegativeCycle
impl Send for NegativeCycle
impl Sync for NegativeCycle
impl Unpin for NegativeCycle
impl UnwindSafe for NegativeCycle
Blanket Implementations§
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.