void function ( Collection arg0 ) { for ( Iterator loc0 = arg0 . iterator ( ) ; loc0 . hasNext ( ) ; ) { Node loc1 = ( Node ) loc0 . next ( ) ; ( ( DirectedEdgeStar ) loc1 . getEdges ( ) ) . linkResultDirectedEdges ( ) ; } }
for nodes in the collection , link the directededges at the node that are in the result . this allows clients to link only a subset of nodes in the graph , for efficiency because they know that only a subset is of interest . concode_field_sep List edgeEndList concode_elem_sep List edges concode_elem_sep NodeMap nodes concode_field_sep Iterator getEdgeIterator concode_elem_sep void add concode_elem_sep Collection getNodes concode_elem_sep Node addNode concode_elem_sep Node addNode concode_elem_sep void debugPrint concode_elem_sep Edge findEdge concode_elem_sep EdgeEnd findEdgeEnd concode_elem_sep void debugPrintln concode_elem_sep Iterator getNodeIterator concode_elem_sep Edge findEdgeInSameDirection concode_elem_sep void addEdges concode_elem_sep void linkAllDirectedEdges concode_elem_sep Node find concode_elem_sep boolean matchInSameDirection concode_elem_sep Collection getEdgeEnds concode_elem_sep void printEdges concode_elem_sep void insertEdge concode_elem_sep boolean isBoundaryNode