protected void populate(Iterator<EdgeInfo> edges){
  info=new EdgeInfo[numVertices][numVertices];
  while (edges.hasNext()) {
    EdgeInfo ei=edges.next();
    ei.flow=0;
    info[ei.start][ei.end]=ei;
  }
}

protected void populate ( Iterator < EdgeInfo > edges ) { info = new EdgeInfo [ numVertices ] [ numVertices ] ; while ( edges . hasNext ( ) ) { EdgeInfo ei = edges . next ( ) ; ei . flow = 0 ; info [ ei . start ] [ ei . end ] = ei ; } }
helper method to populate edges . useful for subclasses as well . note that this allocates the matrix storage so it effectively replaces the entire edge structure found in the graph . be careful when using this !
