Struct daggy::petgraph::visit::Topo

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

A topological order traversal for a graph.

Methods

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

fn new<'a, G>(graph: &'a G) -> Topo<N, VM> where G: Externals<'a, NodeId=N> + Visitable<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, NodeId=N> + Revisitable<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, NodeId=N> + Visitable<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

Derived Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.