Modules§
- Finding the dominators in a control-flow graph.
- A graph module for use in dataflow, region resolution, and elsewhere.
- Routine to compute the strongly connected components (SCCs) of a graph.
Traits§
Functions§
- Returns
true
if the graph has a cycle that is reachable from the start node.