[−][src]Struct bigraph::traversal::DfsPostOrderTraversal

pub struct DfsPostOrderTraversal<Graph, NeighborStrategy, Queue> where
    Graph: GraphBase,
    Queue: BidirectedQueue<<Graph as GraphBase>::NodeIndex>,  { /* fields omitted */ }

Implementations

impl<'a, Graph, NeighborStrategy, Queue> DfsPostOrderTraversal<Graph, NeighborStrategy, Queue> where
    Graph: StaticGraph,
    NeighborStrategy: TraversalNeighborStrategy<'a, Graph>,
    Queue: BidirectedQueue<<Graph as GraphBase>::NodeIndex>, [src]

pub fn new(
    graph: &Graph,
    start: <Graph as GraphBase>::NodeIndex
) -> DfsPostOrderTraversal<Graph, NeighborStrategy, Queue>[src]

pub fn reset(&mut self, start: <Graph as GraphBase>::NodeIndex)[src]

pub fn next(
    &mut self,
    graph: &'a Graph
) -> Option<<Graph as GraphBase>::NodeIndex>[src]

pub fn rank_of(
    &self,
    node: <Graph as GraphBase>::NodeIndex
) -> Option<<Graph as GraphBase>::NodeIndex>[src]

Auto Trait Implementations

impl<Graph, NeighborStrategy, Queue> RefUnwindSafe for DfsPostOrderTraversal<Graph, NeighborStrategy, Queue> where
    Graph: RefUnwindSafe,
    NeighborStrategy: RefUnwindSafe,
    Queue: RefUnwindSafe,
    <Graph as GraphBase>::NodeIndex: RefUnwindSafe,
    <Graph as GraphBase>::OptionalNodeIndex: RefUnwindSafe, 

impl<Graph, NeighborStrategy, Queue> Send for DfsPostOrderTraversal<Graph, NeighborStrategy, Queue> where
    Graph: Send,
    NeighborStrategy: Send,
    Queue: Send,
    <Graph as GraphBase>::NodeIndex: Send,
    <Graph as GraphBase>::OptionalNodeIndex: Send, 

impl<Graph, NeighborStrategy, Queue> Sync for DfsPostOrderTraversal<Graph, NeighborStrategy, Queue> where
    Graph: Sync,
    NeighborStrategy: Sync,
    Queue: Sync,
    <Graph as GraphBase>::NodeIndex: Sync,
    <Graph as GraphBase>::OptionalNodeIndex: Sync, 

impl<Graph, NeighborStrategy, Queue> Unpin for DfsPostOrderTraversal<Graph, NeighborStrategy, Queue> where
    Graph: Unpin,
    NeighborStrategy: Unpin,
    Queue: Unpin,
    <Graph as GraphBase>::NodeIndex: Unpin,
    <Graph as GraphBase>::OptionalNodeIndex: Unpin, 

impl<Graph, NeighborStrategy, Queue> UnwindSafe for DfsPostOrderTraversal<Graph, NeighborStrategy, Queue> where
    Graph: UnwindSafe,
    NeighborStrategy: UnwindSafe,
    Queue: UnwindSafe,
    <Graph as GraphBase>::NodeIndex: UnwindSafe,
    <Graph as GraphBase>::OptionalNodeIndex: UnwindSafe, 

Blanket Implementations

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

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

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

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

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

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.

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.