Struct traitgraph::algo::traversal::DfsPostOrderTraversal [−][src]
pub struct DfsPostOrderTraversal<Graph: GraphBase, NeighborStrategy, Queue: BidirectedQueue<Graph::NodeIndex>> { /* fields omitted */ }
Expand description
A generic depth first postorder graph traversal.
The traversal is generic over the graph implementation,
as well as the direction of the search (NeighborStrategy
)
and the queue implementation (Queue
).
Moreover, the traversal computes the postorder rank of each visited node.
This traversal operates with node-granularity, meaning that the next
method returns nodes.
Implementations
impl<'a, Graph: StaticGraph, NeighborStrategy: TraversalNeighborStrategy<'a, Graph>, Queue: BidirectedQueue<Graph::NodeIndex>> DfsPostOrderTraversal<Graph, NeighborStrategy, Queue>
impl<'a, Graph: StaticGraph, NeighborStrategy: TraversalNeighborStrategy<'a, Graph>, Queue: BidirectedQueue<Graph::NodeIndex>> DfsPostOrderTraversal<Graph, NeighborStrategy, Queue>
Creates a new traversal that operates on the given graph, starting from the given node.
Creates a new traversal that operates on the given graph.
There is no starting node given, and to start the search, one of the reset
methods needs to be used.
Resets the traversal to start from the given node.
Resets the traversal to start from the given node without resetting the visited nodes.
Computes and returns the next node in depth-first search postorder.