Precomputed reverse-post-order walk of a graph.
Declared in <llvm/ADT/PostOrderIterator.h>
template<
class GraphT,
class GT = GraphTraits<GraphT>>
class ReversePostOrderTraversal;Construction walks the entire graph once with a post-order iterator and stores the nodes so later iteration is cheap. Prefer reusing one instance rather than creating many.
| Name | Description |
|---|---|
const_rpo_iterator | Const reverse iterator yielding nodes in reverse post-order. |
rpo_iterator | Mutable reverse iterator yielding nodes in reverse post-order. |
| Name | Description |
|---|---|
ReversePostOrderTraversal [constructor] | Build a reverse-post-order listing of all nodes reachable from G. |
begin | begin overloads |
end | end overloads |