#[non_exhaustive]pub enum GraphError {
SourceEqualsSink,
Cycle,
InvalidWeight,
}Expand description
Errors returned by the graph algorithms in this crate.
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
SourceEqualsSink
The requested operation cannot run because the source equals the sink.
Cycle
A topological sort was requested on a graph that contains a cycle.
InvalidWeight
An edge weight (or, for max_flow, a capacity) is negative, NaN or,
for capacities, infinite. Dijkstra and A* require non-negative weights.
Trait Implementations§
Source§impl Clone for GraphError
impl Clone for GraphError
Source§impl Debug for GraphError
impl Debug for GraphError
impl Eq for GraphError
Source§impl PartialEq for GraphError
impl PartialEq for GraphError
impl StructuralPartialEq for GraphError
Auto Trait Implementations§
impl Freeze for GraphError
impl RefUnwindSafe for GraphError
impl Send for GraphError
impl Sync for GraphError
impl Unpin for GraphError
impl UnsafeUnpin for GraphError
impl UnwindSafe for GraphError
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.