void function ( N arg0 ) { edges . remove ( arg0 ) ; for ( HashSet < N > loc0 : edges . values ( ) ) { loc0 . remove ( arg0 ) ; } }
remove the given node from this graph . as a consequence , any edges for which that node was either a head or a tail will also be removed . concode_field_sep HashMap<N,HashSet<N>> edges concode_field_sep Set<N> getTails concode_elem_sep void removeAllNodes concode_elem_sep void removeEdge concode_elem_sep int getNodeCount concode_elem_sep void addNode concode_elem_sep List<N> findCycle concode_elem_sep boolean isEmpty concode_elem_sep void addEdge concode_elem_sep N removeSink concode_elem_sep N findSink