void function ( N arg0 ) { if ( ! theNeighbors . containsKey ( arg0 ) ) return ; for ( N loc0 : theNeighbors . get ( arg0 ) ) theNeighbors . get ( loc0 ) . remove ( arg0 ) ; theNeighbors . get ( arg0 ) . clear ( ) ; theNeighbors . remove ( arg0 ) ; }
remove node and any links that use node . if node not in graph , nothing happens . concode_field_sep Map<N,Set<N>> theNeighbors concode_elem_sep Set<N> theNodeSet concode_field_sep void add concode_elem_sep void add concode_elem_sep Set<N> neighbors concode_elem_sep Set<N> nodeSet