Class GenericDominators<T>


  • public class GenericDominators<T>
    extends Dominators<T>
    Calculate dominators using Langauer and Tarjan's fastest algorithm. TOPLAS 1(1), July 1979. This implementation uses path compression and results in a O(e * alpha(e,n)) complexity, where e is the number of edges in the CFG and n is the number of nodes. Sources: TOPLAS article, Muchnick book
    • Constructor Detail

      • GenericDominators

        public GenericDominators​(Graph<T> G,
                                 T root)
                          throws java.lang.IllegalArgumentException
        Throws:
        java.lang.IllegalArgumentException