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