Package org.evosuite.graphs.cdg

Class Summary

Class	Description
ControlDependenceGraph
DominatorTree<V>	Given a CFG this class computes the immediateDominators and the dominatingFrontiers for each CFG vertex The current algorithm to determine the immediateDominators runs in time O(e*log n) where e is the number of control flow edges and n the number of CFG vertices and is taken from: "A Fast Algorithm for Finding Dominators in a Flowgraph" THOMAS LENGAUER and ROBERT ENDRE TARJAN 1979, Stanford University DOI: 10.1145/357062.357071 http://portal.acm.org/citation.cfm?doid=357062.357071 The algorithm for computing the dominatingFrontiers when given the immediateDominators is taken from "Efficiently Computing Static Single Assignment Form and the Control Dependence Graph" RON CYTRON, JEANNE FERRANTE, BARRY K.