Struct petgraph::visit::Topo[−][src]

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

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 kosaraju_scc to handle graphs with possible cycles.

Implementations

impl<N, VM> Topo<N, VM> where
    N: Copy + PartialEq,
    VM: VisitMap<N>, [src]

pub fn new<G>(graph: G) -> Self where
    G: IntoNodeIdentifiers + IntoNeighborsDirected + Visitable<NodeId = N, Map = VM>, [src]

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

pub fn reset<G>(&mut self, graph: G) where
    G: IntoNodeIdentifiers + IntoNeighborsDirected + Visitable<NodeId = N, Map = VM>, [src]

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

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

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>[src]

Returns a copy of the value. Read more

fn clone_from(&mut self, source: &Self)1.0.0[src]

Performs copy-assignment from source. Read more

impl<G> Walker<G> for Topo<G::NodeId, G::Map> where
    G: IntoNeighborsDirected + Visitable, [src]

type Item = G::NodeId

fn walk_next(&mut self, context: G) -> Option<Self::Item>[src]

Advance to the next item

fn iter(self, context: Context) -> WalkerIter<Self, Context>ⓘ

Notable traits for WalkerIter<W, C>

impl<W, C> Iterator for WalkerIter<W, C> where
    W: Walker<C>,
    C: Clone,  type Item = W::Item;
 where
    Self: Sized,
    Context: Clone, [src]

Create an iterator out of the walker and given context.

Auto Trait Implementations

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

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

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

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

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

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

pub fn type_id(&self) -> TypeId[src]

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

pub fn borrow(&self) -> &T[src]

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

pub fn borrow_mut(&mut self) -> &mut T[src]

Mutably borrows from an owned value. Read more

impl<T> From<T> for T[src]

pub fn from(t: T) -> T[src]

Performs the conversion.

impl<T, U> Into<U> for T where
    U: From<T>, [src]

pub fn into(self) -> U[src]

Performs the conversion.

impl<T> ToOwned for T where
    T: Clone, [src]

type Owned = T

The resulting type after obtaining ownership.

pub fn to_owned(&self) -> T[src]

Creates owned data from borrowed data, usually by cloning. Read more

pub fn clone_into(&self, target: &mut T)[src]

🔬 This is a nightly-only experimental API. (toowned_clone_into)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]

Performs the conversion.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>[src]

Performs the conversion.