/guava/android/guava/src/com/google/common/graph/Traverser.java
} }return element;
return element; } }
N visitNext(Deque<Iterator<? extends N>> horizon) { Iterator<? extends N> top = horizon.getFirst(); while (top.hasNext()) { N element = top.next(); requireNonNull(element); if (visited.add(element)) { <extra_id_0> horizon.removeFirst(); return null; } }; } static <N> Traversal<N> inTree(SuccessorsFunction<N> tree) {