DirectedGraph function ( ) { DirectedGraph loc0 = new DirectedGraph ( vertices ) ; for ( int loc1 = 0 ; loc1 < vertices ; loc1 ++ ) { for ( Integer loc2 : adj ( loc1 ) ) { loc0 . addEdge ( loc2 , loc1 ) ; } } return loc0 ; }
returns the graph with edges flipped . concode_field_sep int vertices concode_elem_sep Bag<Integer>[] adj concode_elem_sep int edges concode_field_sep int vertices concode_elem_sep Iterable<Integer> adj concode_elem_sep int edges concode_elem_sep void check concode_elem_sep void addEdge