Struct petgraph::visit::DfsPostOrder
[−]
[src]
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
Methods
impl<N, VM> DfsPostOrder<N, VM> where
N: Copy + PartialEq,
VM: VisitMap<N>,
[src]
N: Copy + PartialEq,
VM: VisitMap<N>,
pub fn new<G>(graph: G, start: N) -> Self where
G: GraphRef + Visitable<NodeId = N, Map = VM>,
[src]
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>,
[src]
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>,
[src]
G: GraphRef + Visitable<NodeId = N, Map = VM>,
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]
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>
[src]
fn clone(&self) -> DfsPostOrder<N, VM>
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<N: Debug, VM: Debug> Debug for DfsPostOrder<N, VM>
[src]
fn fmt(&self, __arg_0: &mut Formatter) -> Result
[src]
Formats the value using the given formatter. Read more
impl<G> Walker<G> for DfsPostOrder<G::NodeId, G::Map> where
G: IntoNeighbors + Visitable,
[src]
G: IntoNeighbors + Visitable,
type Item = G::NodeId
fn walk_next(&mut self, context: G) -> Option<Self::Item>
[src]
Advance to the next item
ⓘImportant traits for WalkerIter<W, C>fn iter(self, context: Context) -> WalkerIter<Self, Context> where
Self: Sized,
Context: Clone,
[src]
Self: Sized,
Context: Clone,
Create an iterator out of the walker and given context
.