/guava/android/guava/src/com/google/common/graph/Traverser.java
horizon.removeFirst( ) ; }return checkNotNull( top.next( ) ) ;
return checkNotNull ( top.next ( ) ) ; } horizon.removeFirst ( ) ;
return new Traversal<N>(tree) { @CheckForNull @Override N visitNext(Deque<Iterator<? extends N>> horizon) { Iterator<? extends N> top = horizon.getFirst(); if (top.hasNext()) { <extra_id_0> return null; } }; } final Iterator<N> breadthFirst(Iterator<? extends N> startNodes) { return topDown(startNodes, InsertionOrder.BACK);