pub enum DfsEvent<N, E> {
Discover(N, Time),
TreeEdge(N, N, E),
BackEdge(N, N, E),
CrossForwardEdge(N, N, E),
Finish(N, Time),
}Expand description
A depth first search (DFS) visitor event.
It’s similar to upstream petgraph
DfsEvent
event.
Variants§
Discover(N, Time)
TreeEdge(N, N, E)
An edge of the tree formed by the traversal.
BackEdge(N, N, E)
An edge to an already visited node.
CrossForwardEdge(N, N, E)
A cross or forward edge.
For an edge (u, v), if the discover time of v is greater than u, then it is a forward edge, else a cross edge.
Finish(N, Time)
All edges from a node have been reported.
Trait Implementations§
impl<N: Copy, E: Copy> Copy for DfsEvent<N, E>
Auto Trait Implementations§
impl<N, E> Freeze for DfsEvent<N, E>
impl<N, E> RefUnwindSafe for DfsEvent<N, E>where
N: RefUnwindSafe,
E: RefUnwindSafe,
impl<N, E> Send for DfsEvent<N, E>
impl<N, E> Sync for DfsEvent<N, E>
impl<N, E> Unpin for DfsEvent<N, E>
impl<N, E> UnwindSafe for DfsEvent<N, E>where
N: UnwindSafe,
E: UnwindSafe,
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<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more