[−][src]Enum petgraph::visit::DfsEvent
pub enum DfsEvent<N> { Discover(N, Time), TreeEdge(N, N), BackEdge(N, N), CrossForwardEdge(N, N), Finish(N, Time), }
A depth first search (DFS) visitor event.
Variants
Discover(N, Time)
An edge of the tree formed by the traversal.
An edge to an already visited node.
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: Clone> Clone for DfsEvent<N>
[src][+]
impl<N: Copy> Copy for DfsEvent<N>
[src]
impl<N: Debug> Debug for DfsEvent<N>
[src][+]
Auto Trait Implementations
impl<N> RefUnwindSafe for DfsEvent<N> where
N: RefUnwindSafe,
N: RefUnwindSafe,
impl<N> Send for DfsEvent<N> where
N: Send,
N: Send,
impl<N> Sync for DfsEvent<N> where
N: Sync,
N: Sync,
impl<N> Unpin for DfsEvent<N> where
N: Unpin,
N: Unpin,
impl<N> UnwindSafe for DfsEvent<N> where
N: UnwindSafe,
N: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src][+]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src][+]
T: ?Sized,
impl<T> From<T> for T
[src][+]
impl<T, U> Into<U> for T where
U: From<T>,
[src][+]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src][+]
T: Clone,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src][+]
U: Into<T>,
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src][+]
U: TryFrom<T>,