void function ( N arg0 , N arg1 ) { HashSet < N > loc0 = edges . get ( arg1 ) ; if ( loc0 == null ) { edges . put ( arg1 , new HashSet < N > ( ) ) ; } loc0 = edges . get ( arg0 ) ; if ( loc0 == null ) { loc0 = new HashSet < N > ( ) ; edges . put ( arg0 , loc0 ) ; } loc0 . add ( arg1 ) ; }
add an edge from the given head node to the given tail node . both nodes will be a part of the graph after this method is invoked , whether or not they were before . 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 N removeSink concode_elem_sep void removeNode concode_elem_sep N findSink