#[non_exhaustive]pub enum GraphPathMode {
Walk,
Trail,
Acyclic,
Simple,
}Expand description
Filters paths. Options other than Walk ensure a finite number of matches.
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.
Walk
No filtering of edges/nodes.
Trail
No repeated edges.
Acyclic
No repeated nodes.
Simple
No repeated nodes, except that the first and last nodes may be the same.
Trait Implementations§
Source§impl Clone for GraphPathMode
impl Clone for GraphPathMode
Source§impl Debug for GraphPathMode
impl Debug for GraphPathMode
impl Eq for GraphPathMode
Source§impl PartialEq for GraphPathMode
impl PartialEq for GraphPathMode
Source§impl PrettyDoc for GraphPathMode
impl PrettyDoc for GraphPathMode
fn pretty_doc<'b, D, A>(&'b self, arena: &'b D) -> DocBuilder<'b, D, A>
impl StructuralPartialEq for GraphPathMode
Auto Trait Implementations§
impl Freeze for GraphPathMode
impl RefUnwindSafe for GraphPathMode
impl Send for GraphPathMode
impl Sync for GraphPathMode
impl Unpin for GraphPathMode
impl UnsafeUnpin for GraphPathMode
impl UnwindSafe for GraphPathMode
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.