pub enum DfsEvent<N> {
Discover(N, Time),
TreeEdge(N, N),
BackEdge(N, N),
CrossForwardEdge(N, N),
Finish(N, Time),
}
Expand description
A depth first search (DFS) visitor event.
Variants§
Discover(N, Time)
TreeEdge(N, N)
An edge of the tree formed by the traversal.
BackEdge(N, N)
An edge to an already visited node.
CrossForwardEdge(N, N)
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)
Trait Implementations§
impl<N: Copy> Copy for DfsEvent<N>
Auto Trait Implementations§
impl<N> Freeze for DfsEvent<N>where
N: Freeze,
impl<N> RefUnwindSafe for DfsEvent<N>where
N: RefUnwindSafe,
impl<N> Send for DfsEvent<N>where
N: Send,
impl<N> Sync for DfsEvent<N>where
N: Sync,
impl<N> Unpin for DfsEvent<N>where
N: Unpin,
impl<N> UnwindSafe for DfsEvent<N>where
N: 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§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)