Struct petgraph::visit::DfsPostOrder

[+] Show declaration

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

[−] Expand description

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>

[−] Expand description

The stack of nodes to visit

discovered: VM

[−] Expand description

The map of discovered nodes

finished: VM

[−] Expand description

The map of finished nodes

Implementations

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

pub 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.

pub 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.

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

Clear the visit state

pub 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.

pub 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>[+]

[+] Show hidden undocumented items

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>[+]

[+] Show hidden undocumented items

fn fmt(&self, f: &mut Formatter) -> Result[−]

Formats the value using the given formatter.

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

[+] Show hidden undocumented items

type Item = G::NodeId

fn walk_next(&mut self, context: G) -> Option<Self::Item>[−]

Advance to the next item

fn iter(self, context: Context) -> WalkerIter<Self, Context> where
    Self: Sized,
    Context: Clone, [−]

Create an iterator out of the walker and given context.