Struct bevy::utils::petgraph::prelude::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>,

pub fn new<G>(graph: G, start: N) -> DfsPostOrder<N, VM>

where G: GraphRef<NodeId = N> + Visitable<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) -> DfsPostOrder<N, VM>

where G: GraphRef<NodeId = N> + Visitable<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<NodeId = N> + Visitable<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, VM> Clone for DfsPostOrder<N, VM>

where N: Clone, VM: Clone,

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, VM> Debug for DfsPostOrder<N, VM>

where N: Debug, VM: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<N, VM> Default for DfsPostOrder<N, VM>

where VM: Default,

fn default() -> DfsPostOrder<N, VM>

Returns the “default value” for a type.

impl<G> Walker<G> for DfsPostOrder<<G as GraphBase>::NodeId, <G as Visitable>::Map>

where G: IntoNeighbors + Visitable,

type Item = <G as GraphBase>::NodeId

fn walk_next( &mut self, context: G ) -> Option<<DfsPostOrder<<G as GraphBase>::NodeId, <G as Visitable>::Map> as Walker<G>>::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.