Package com.ensoftcorp.open.commons.algorithms.dominance

Class Summary

Class	Description
DepthFirstPreorderIterator	DepthFirstPreorderIterator yields a depth-first pre-order traversal of a graph.
DominatorTree	An implementation of the O(n log n) Lengauer-Tarjan algorithm for building the dominator tree of a graph.
DominatorTree.Multimap<T>	Multimap maps a key to a set of values.
InvertedDepthFirstPreorderIterator	InvertedDepthFirstPreorderIterator yields a depth-first an inverted pre-order traversal of a graph
PostDominatorTree	An implementation of the O(n log n) Lengauer-Tarjan algorithm for building the dominator tree of a cfg.
PostDominatorTree.Multimap<T>	Multimap maps a key to a set of values.