private void initializeWorkList(){
  for (  GVCongruenceClass c : B) {
    if (c.size() == 1) {
      continue;
    }
    Iterator<ValueGraphVertex> i=c.iterator();
    ValueGraphVertex first=i.next();
    while (i.hasNext()) {
      ValueGraphVertex v=i.next();
      if (!checkCongruence(first,v)) {
        workList.push(c);
        break;
      }
    }
  }
}

private void initializeWorkList ( ) { for ( GVCongruenceClass c : B ) { if ( c . size ( ) == 1 ) { continue ; } Iterator < ValueGraphVertex > i = c . iterator ( ) ; ValueGraphVertex first = i . next ( ) ; while ( i . hasNext ( ) ) { ValueGraphVertex v = i . next ( ) ; if ( ! checkCongruence ( first , v ) ) { workList . push ( c ) ; break ; } } } }
initialize the work list . a congruence class gets put on the work list if any two nodes in the class point to corresponding targets in separate partitions .
