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