[−][src]Struct traitgraph::traversal::DfsPostOrderTraversal
Implementations
impl<'a, Graph: StaticGraph, NeighborStrategy: TraversalNeighborStrategy<'a, Graph>, Queue: BidirectedQueue<Graph::NodeIndex>> DfsPostOrderTraversal<Graph, NeighborStrategy, Queue>
[src]
pub fn new(graph: &Graph, start: Graph::NodeIndex) -> Self
[src]
pub fn reset(&mut self, start: Graph::NodeIndex)
[src]
pub fn next(&mut self, graph: &'a Graph) -> Option<Graph::NodeIndex>
[src]
pub fn rank_of(&self, node: Graph::NodeIndex) -> Option<Graph::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,
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,
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,
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,
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,
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]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,