Struct petgraph::visit::SubTopo

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

A topological order traversal for a subgraph.

SubTopo starts at a node, and does a topological order traversal of all nodes reachable from the starting point.

Methods

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

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

Create a new SubTopo, using the graph's visitor map, and put single node in the to-visit list.

fn reset_with_node<G>(&mut self, graph: &G, node: N) where G: Visitable<NodeId=N, Map=VM>

Clear visited state, and put a single node into the 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 subgraph may not have a complete topological order. If there is a cycle in the subgraph, then nodes of that cycle are included in this traversal.

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.