Iterable < Edge > function ( ) { List < Edge > loc0 = new ArrayList < Edge > ( ) ; for ( int loc1 = 0 ; loc1 < V ; loc1 ++ ) { for ( Edge loc2 : adj ( loc1 ) ) { if ( loc2 . other ( loc1 ) > loc1 ) loc0 . add ( loc2 ) ; } } return loc0 ; }
all edges in this graph concode_field_sep int E concode_elem_sep List<Edge>[] adj concode_elem_sep int V concode_field_sep int E concode_elem_sep int V concode_elem_sep Iterable<Edge> adj concode_elem_sep void addEdge