Struct petgraph::visit::Topo

pub struct Topo<N, VM> { /* fields omitted */ }

A topological order traversal for a graph.

Note that Topo only visits nodes that are not part of cycles, i.e. nodes in a true DAG. Use other visitors like DfsPostOrder or algorithms like scc to handle graphs with possible cycles.

Methods

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

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

Create a new Topo, using the graph's visitor map, and put all initial nodes in the to visit list.

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

Clear visited state, and put all initial nodes in the to visit list.

fn next<G>(&mut self, g: G) -> Option<N> where G: IntoNeighborsDirected + Visitable<NodeId=N, Map=VM>

Return the next node in the current topological order traversal, or None if the traversal is at the end.

Note: The graph may not have a complete topological order, and the only way to know is to run the whole traversal and make sure it visits every node.

Trait Implementations

impl<N: Clone, VM: Clone> Clone for Topo<N, VM>

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

Returns a copy of the value.

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

Performs copy-assignment from source.