V - the graph vertex typeE - the graph edge typepublic class BreadthFirstIterator<V,E> extends CrossComponentIterator<V,E,Object>
For this iterator to work correctly the graph must not be modified during iteration. Currently there are no means to ensure that, nor to fail-fast. The results of such modifications are undefined.
crossComponentTraversal, graph, nListeners, reusableEdgeEvent, reusableVertexEvent, reuseEvents| Constructor and Description | 
|---|
| BreadthFirstIterator(Graph<V,E> g)Creates a new breadth-first iterator for the specified graph. | 
| BreadthFirstIterator(Graph<V,E> g,
                    Iterable<V> startVertices)Creates a new breadth-first iterator for the specified graph. | 
| BreadthFirstIterator(Graph<V,E> g,
                    V startVertex)Creates a new breadth-first iterator for the specified graph. | 
| Modifier and Type | Method and Description | 
|---|---|
| protected void | encounterVertex(V vertex,
               E edge)Update data structures the first time we see a vertex. | 
| protected void | encounterVertexAgain(V vertex,
                    E edge)Called whenever we re-encounter a vertex. | 
| protected boolean | isConnectedComponentExhausted()Returns true if there are no more uniterated vertices in the currently iterated
 connected component; false otherwise. | 
| protected V | provideNextVertex()Returns the vertex to be returned in the following call to the iterator  nextmethod. | 
finishVertex, getSeenData, hasNext, isSeenVertex, next, putSeenDataaddTraversalListener, createEdgeTraversalEvent, createVertexTraversalEvent, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, getGraph, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setCrossComponentTraversal, setReuseEventsclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitforEachRemainingpublic BreadthFirstIterator(Graph<V,E> g)
g - the graph to be iterated.public BreadthFirstIterator(Graph<V,E> g, V startVertex)
null, iteration will start at an
 arbitrary vertex and will not be limited, that is, will be able to traverse all the graph.g - the graph to be iterated.startVertex - the vertex iteration to be started.public BreadthFirstIterator(Graph<V,E> g, Iterable<V> startVertices)
null, iteration will start at an
 arbitrary vertex and will not be limited, that is, will be able to traverse all the graph.g - the graph to be iterated.startVertices - the vertices iteration to be started.protected boolean isConnectedComponentExhausted()
CrossComponentIteratorisConnectedComponentExhausted in class CrossComponentIterator<V,E,Object>CrossComponentIterator.isConnectedComponentExhausted()protected void encounterVertex(V vertex, E edge)
CrossComponentIteratorencounterVertex in class CrossComponentIterator<V,E,Object>vertex - the vertex encounterededge - the edge via which the vertex was encountered, or null if the vertex is a
        starting pointCrossComponentIterator.encounterVertex(Object, Object)protected void encounterVertexAgain(V vertex, E edge)
CrossComponentIteratorencounterVertexAgain in class CrossComponentIterator<V,E,Object>vertex - the vertex re-encounterededge - the edge via which the vertex was re-encounteredCrossComponentIterator.encounterVertexAgain(Object, Object)protected V provideNextVertex()
CrossComponentIteratornext
 method.provideNextVertex in class CrossComponentIterator<V,E,Object>CrossComponentIterator.provideNextVertex()Copyright © 2017. All rights reserved.