void function ( DirectedEdge arg0 ) { int loc0 = arg0 . from ( ) ; int loc1 = arg0 . to ( ) ; if ( adj [ loc0 ] [ loc1 ] == null ) { E ++ ; adj [ loc0 ] [ loc1 ] = arg0 ; } }
adds the directed edge e to the edge-weighted digraph if there is not already an edge with the same endpoints . concode_field_sep String NEWLINE concode_elem_sep int E concode_elem_sep int V concode_elem_sep DirectedEdge[][] adj concode_elem_sep int v concode_elem_sep int w concode_field_sep DirectedEdge next concode_elem_sep Iterator<DirectedEdge> iterator concode_elem_sep int E concode_elem_sep int V concode_elem_sep Iterable<DirectedEdge> adj concode_elem_sep boolean hasNext concode_elem_sep String toString concode_elem_sep void main concode_elem_sep void remove