Enum petgraph::visit::DfsEvent[−][src]

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)
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)
[−]

All edges from a node have been reported.

Trait Implementations

impl<N: Clone> Clone for DfsEvent<N>[src]

impl<N: Debug> Debug for DfsEvent<N>[src]

impl<N: Copy> Copy for DfsEvent<N>[src]

Auto Trait Implementations

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

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T> Pointable for T[src]

type Init = T

The type for initializers.

impl<T> ToOwned for T where
    T: Clone, [src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.