See: Description
| Class | Description |
|---|---|
| DepthFirstPreorderIterator |
DepthFirstPreorderIterator yields a depth-first preorder traversal of a
IFlowgraph. |
| DominatorTree |
An implementation of the O(n log n) Lengauer-Tarjan algorithm for building the
dominator tree
of a
flowgraph. |
| DominatorTree.Multimap<T> |
Multimap maps a key to a set of values.
|
Copyright © 2016 The Apache Software Foundation. All rights reserved.