question: public Optimized ( int n , int s , int t , Iterator < EdgeInfo > edges ) { super ( n , s , t ) ; queue = new int [ n ] ; QUEUE_SIZE = n ; capacity = new int [ n ] [ n ] ; flow = new int [ n ] [ n ] ; previous = new int [ n ] ; visited = new int [ n ] ; while ( edges . hasNext ( ) ) { EdgeInfo ei = edges . next ( ) ; capacity [ ei . start ] [ ei . end ] = ei . capacity ; } }
target:  Load up information for this network problem. 