VertexIterator vi = g.adjacentVertices(v); while(vi.hasNext()) { int nextVertex = vi.next(); pathTo[nextVertex] = pathTo[v] + nextVertex + " "; q.add(nextVertex);
@Override public void addPartitionVertices(VertexIterator<I, V, E> vertexIterator) { while (vertexIterator.hasNext()) { vertexIterator.next(); // Release the vertex if it was put, otherwise reuse as an optimization if (putOrCombine(vertexIterator.getVertex())) { vertexIterator.releaseVertex(); } } }