public SimpleDominatorsFinder(DirectedGraph<N> graph){
  this.graph=graph;
  SimpleDominatorsAnalysis<N> analysis=new SimpleDominatorsAnalysis<N>(graph);
{
    nodeToDominators=new HashMap<N,FlowSet<N>>(graph.size() * 2 + 1,0.7f);
    for (Iterator<N> nodeIt=graph.iterator(); nodeIt.hasNext(); ) {
      N node=nodeIt.next();
      FlowSet<N> set=analysis.getFlowAfter(node);
      nodeToDominators.put(node,set);
    }
  }
}

public SimpleDominatorsFinder ( DirectedGraph < N > graph ) { this . graph = graph ; SimpleDominatorsAnalysis < N > analysis = new SimpleDominatorsAnalysis < N > ( graph ) ; { nodeToDominators = new HashMap < N , FlowSet < N > > ( graph . size ( ) * 2 + 1 , 0.7f ) ; for ( Iterator < N > nodeIt = graph . iterator ( ) ; nodeIt . hasNext ( ) ; ) { N node = nodeIt . next ( ) ; FlowSet < N > set = analysis . getFlowAfter ( node ) ; nodeToDominators . put ( node , set ) ; } } }
compute dominators for provided singled - headed directed graph .
