Struct petgraph::visit::DfsPostOrder
source · 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>
The stack of nodes to visit
discovered: VM
The map of discovered nodes
finished: VM
The map of finished nodes
Implementations§
source§impl<N, VM> DfsPostOrder<N, VM>
impl<N, VM> DfsPostOrder<N, VM>
sourcepub fn new<G>(graph: G, start: N) -> Self
pub fn new<G>(graph: G, start: N) -> Self
Create a new DfsPostOrder
using the graph’s visitor map, and put
start
in the stack of nodes to visit.
sourcepub fn empty<G>(graph: G) -> Self
pub fn empty<G>(graph: G) -> Self
Create a new DfsPostOrder
using the graph’s visitor map, and no stack.
sourcepub fn move_to(&mut self, start: N)
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.
sourcepub fn next<G>(&mut self, graph: G) -> Option<N>where
G: IntoNeighbors<NodeId = N>,
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§
source§impl<N: Clone, VM: Clone> Clone for DfsPostOrder<N, VM>
impl<N: Clone, VM: Clone> Clone for DfsPostOrder<N, VM>
source§fn clone(&self) -> DfsPostOrder<N, VM>
fn clone(&self) -> DfsPostOrder<N, VM>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<N, VM> Default for DfsPostOrder<N, VM>where
VM: Default,
impl<N, VM> Default for DfsPostOrder<N, VM>where
VM: Default,
source§impl<G> Walker<G> for DfsPostOrder<G::NodeId, G::Map>where
G: IntoNeighbors + Visitable,
impl<G> Walker<G> for DfsPostOrder<G::NodeId, G::Map>where
G: IntoNeighbors + Visitable,
Auto Trait Implementations§
impl<N, VM> Freeze for DfsPostOrder<N, VM>where
VM: Freeze,
impl<N, VM> RefUnwindSafe for DfsPostOrder<N, VM>where
VM: RefUnwindSafe,
N: RefUnwindSafe,
impl<N, VM> Send for DfsPostOrder<N, VM>
impl<N, VM> Sync for DfsPostOrder<N, VM>
impl<N, VM> Unpin for DfsPostOrder<N, VM>
impl<N, VM> UnwindSafe for DfsPostOrder<N, VM>where
VM: UnwindSafe,
N: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)