Struct petgraph::visit::Topo
[−]
[src]
pub struct Topo<N, VM> { /* fields omitted */ }
A topological order traversal for a graph.
Methods
impl<N, VM> Topo<N, VM> where
N: Clone,
VM: VisitMap<N>,
[src]
N: Clone,
VM: VisitMap<N>,
fn new<'a, G>(graph: &'a G) -> Self where
G: Externals<'a> + Visitable<NodeId = N, Map = VM>,
G: Externals<'a> + 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<'a, G>(&mut self, graph: &'a G) where
G: Externals<'a> + Revisitable<NodeId = N, Map = VM>,
G: Externals<'a> + Revisitable<NodeId = N, Map = VM>,
Clear visited state, and put all initial nodes into the visit list.
fn next<'a, G>(&mut self, g: &'a G) -> Option<N> where
G: NeighborsDirected<'a> + Visitable<NodeId = N, Map = VM>,
G: NeighborsDirected<'a> + 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>
[src]
fn clone(&self) -> Topo<N, VM>
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more