/guava/android/guava/src/com/google/common/graph/Traverser.java
return next; if ( !successors.hasNext( ) ) {Iterator<? extends N> successors = successorFunction.successors( next).iterator( ) ;
Iterator<? extends N> successors = successorFunction.successors ( next ) .iterator ( ) ; if ( !successors.hasNext ( ) ) { return next;
horizon.add(startNodes); return new AbstractIterator<N>() { @Override @CheckForNull protected N computeNext() { for (N next = visitNext(horizon); next != null; next = visitNext(horizon)) { <extra_id_0> } horizon.addFirst(successors); ancestorStack.push(next); } if (!ancestorStack.isEmpty()) { return ancestorStack.pop();