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