Review

11

com/google/javascript/jscomp/graph/LinkedDirectedGraph.java

next()

class LinkedDirectedGraph.LinkedDirectedGraphNode.NeighborIterator {
      @Override
      public GraphNode<N, E> next() {
        boolean isOut = !in.hasNext();
        Iterator<DiGraphEdge<N, E>> curIterator =  isOut ? out : in;
        DiGraphEdge<N, E> s = curIterator.next();
        return isOut ? s.getDestination() : s.getSource();
      }

}