Iterator<Node<T>>
DirectedAcyclicGraph<T>
boolean
hasNext()
Node<T>
next()
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
forEachRemaining, remove
hasNext
next