[][src]Struct petgraph::visit::DfsPostOrder

pub struct DfsPostOrder<N, VM> {
    pub stack: Vec<N>,
    pub discovered: VM,
    pub finished: VM,
}

Visit nodes in a depth-first-search (DFS) emitting nodes in postorder (each node after all its descendants have been emitted).

DfsPostOrder is not recursive.

The traversal starts at a given node and only traverses nodes reachable from it.

Fields

stack: Vec<N>

The stack of nodes to visit

discovered: VM

The map of discovered nodes

finished: VM

The map of finished nodes

Implementations

impl<N, VM> DfsPostOrder<N, VM> where
    N: Copy + PartialEq,
    VM: VisitMap<N>, 
[src]

pub fn new<G>(graph: G, start: N) -> Self where
    G: GraphRef + Visitable<NodeId = N, Map = VM>, 
[src]

Create a new DfsPostOrder using the graph's visitor map, and put start in the stack of nodes to visit.

pub fn empty<G>(graph: G) -> Self where
    G: GraphRef + Visitable<NodeId = N, Map = VM>, 
[src]

Create a new DfsPostOrder using the graph's visitor map, and no stack.

pub fn reset<G>(&mut self, graph: G) where
    G: GraphRef + Visitable<NodeId = N, Map = VM>, 
[src]

Clear the visit state

pub fn move_to(&mut self, start: N)[src]

Keep the discovered and finished map, but clear the visit stack and restart the dfs from a particular node.

pub fn next<G>(&mut self, graph: G) -> Option<N> where
    G: IntoNeighbors<NodeId = N>, 
[src]

Return the next node in the traversal, or None if the traversal is done.

Trait Implementations

impl<N: Clone, VM: Clone> Clone for DfsPostOrder<N, VM>[src]

impl<N: Debug, VM: Debug> Debug for DfsPostOrder<N, VM>[src]

impl<G> Walker<G> for DfsPostOrder<G::NodeId, G::Map> where
    G: IntoNeighbors + Visitable
[src]

type Item = G::NodeId

Auto Trait Implementations

impl<N, VM> RefUnwindSafe for DfsPostOrder<N, VM> where
    N: RefUnwindSafe,
    VM: RefUnwindSafe

impl<N, VM> Send for DfsPostOrder<N, VM> where
    N: Send,
    VM: Send

impl<N, VM> Sync for DfsPostOrder<N, VM> where
    N: Sync,
    VM: Sync

impl<N, VM> Unpin for DfsPostOrder<N, VM> where
    N: Unpin,
    VM: Unpin

impl<N, VM> UnwindSafe for DfsPostOrder<N, VM> where
    N: UnwindSafe,
    VM: 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> 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.