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 decendants 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

Methods

impl<N, VM> DfsPostOrder<N, VM> where N: Copy, VM: VisitMap<N>

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

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

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

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

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

Clear the visit state

fn move_to(&mut self, start: N)

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

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

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>

fn clone(&self) -> DfsPostOrder<N, VM>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<N: Debug, VM: Debug> Debug for DfsPostOrder<N, VM>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.