Struct traitgraph_algo::traversal::DfsPostOrderTraversal

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

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<Graph>, Queue: BidirectedQueue<Graph::NodeIndex>> DfsPostOrderTraversal<Graph, NeighborStrategy, Queue>

pub fn new(graph: &Graph, start: Graph::NodeIndex) -> Self

Creates a new traversal that operates on the given graph, starting from the given node.

pub fn new_without_start(graph: &Graph) -> Self

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.

pub fn reset(&mut self, start: Graph::NodeIndex)

Resets the traversal to start from the given node.

pub fn continue_traversal_from(&mut self, start: Graph::NodeIndex)

Resets the traversal to start from the given node without resetting the visited nodes.

pub fn next(&mut self, graph: &'a Graph) -> Option<Graph::NodeIndex>

Computes and returns the next node in depth-first search postorder.

pub fn rank_of(&self, node: Graph::NodeIndex) -> Option<Graph::NodeIndex>

Returns the rank of a node in depth-first search postorder, or None if the node has not yet been processed completely.