Precomputed reverse‐post‐order walk of a graph.

Synopsis

Declared in <llvm/ADT/PostOrderIterator.h>

template<
    class GraphT,
    class GT = GraphTraits<GraphT>>
class ReversePostOrderTraversal;

Description

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.

Type Aliases

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.

Member Functions

Name

Description

ReversePostOrderTraversal [constructor]

Build a reverse‐post‐order listing of all nodes reachable from G.

begin

begin overloads

end

end overloads

Created with MrDocs