Package org.jgrapht.traverse
Class DepthFirstIterator<V,E>
- java.lang.Object
-
- org.jgrapht.traverse.AbstractGraphIterator<V,E>
-
- org.jgrapht.traverse.CrossComponentIterator<V,E,DepthFirstIterator.VisitColor>
-
- org.jgrapht.traverse.DepthFirstIterator<V,E>
-
- Type Parameters:
V
- the graph vertex typeE
- the graph edge type
- All Implemented Interfaces:
java.util.Iterator<V>
,GraphIterator<V,E>
public class DepthFirstIterator<V,E> extends CrossComponentIterator<V,E,DepthFirstIterator.VisitColor>
A depth-first iterator for a directed or undirected graph.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.
- Author:
- Liviu Rau, Barak Naveh
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description protected static class
DepthFirstIterator.VisitColor
Standard vertex visit state enumeration.
-
Field Summary
Fields Modifier and Type Field Description static java.lang.Object
SENTINEL
Sentinel object.-
Fields inherited from class org.jgrapht.traverse.AbstractGraphIterator
crossComponentTraversal, graph, nListeners, reusableEdgeEvent, reusableVertexEvent, reuseEvents
-
-
Constructor Summary
Constructors Constructor Description DepthFirstIterator(Graph<V,E> g)
Creates a new depth-first iterator for the specified graph.DepthFirstIterator(Graph<V,E> g, java.lang.Iterable<V> startVertices)
Creates a new depth-first iterator for the specified graph.DepthFirstIterator(Graph<V,E> g, V startVertex)
Creates a new depth-first iterator for the specified graph.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method 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.java.util.Deque<java.lang.Object>
getStack()
Retrieves the LIFO stack of vertices which have been encountered but not yet visited (WHITE).protected boolean
isConnectedComponentExhausted()
Returnstrue
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 iteratornext
method.-
Methods inherited from class org.jgrapht.traverse.CrossComponentIterator
finishVertex, getEntireGraphVertexIterator, getSeenData, hasNext, isSeenVertex, next, putSeenData, selectOutgoingEdges
-
Methods inherited from class org.jgrapht.traverse.AbstractGraphIterator
addTraversalListener, createEdgeTraversalEvent, createVertexTraversalEvent, fireConnectedComponentFinished, fireConnectedComponentStarted, fireEdgeTraversed, fireVertexFinished, fireVertexTraversed, getGraph, isCrossComponentTraversal, isReuseEvents, remove, removeTraversalListener, setCrossComponentTraversal, setReuseEvents
-
-
-
-
Constructor Detail
-
DepthFirstIterator
public DepthFirstIterator(Graph<V,E> g)
Creates a new depth-first iterator for the specified graph.- Parameters:
g
- the graph to be iterated.
-
DepthFirstIterator
public DepthFirstIterator(Graph<V,E> g, V startVertex)
Creates a new depth-first iterator for the specified graph. Iteration will start at the specified start vertex and will be limited to the connected component that includes that vertex. If the specified start vertex isnull
, iteration will start at an arbitrary vertex and will not be limited, that is, will be able to traverse all the graph.- Parameters:
g
- the graph to be iterated.startVertex
- the vertex iteration to be started.
-
DepthFirstIterator
public DepthFirstIterator(Graph<V,E> g, java.lang.Iterable<V> startVertices)
Creates a new depth-first iterator for the specified graph. Iteration will start at the specified start vertices and will be limited to the connected component that includes those vertices. If the specified start vertices isnull
, iteration will start at an arbitrary vertex and will not be limited, that is, will be able to traverse all the graph.- Parameters:
g
- the graph to be iterated.startVertices
- the vertices iteration to be started.
-
-
Method Detail
-
isConnectedComponentExhausted
protected boolean isConnectedComponentExhausted()
Description copied from class:CrossComponentIterator
Returnstrue
if there are no more uniterated vertices in the currently iterated connected component;false
otherwise.- Specified by:
isConnectedComponentExhausted
in classCrossComponentIterator<V,E,DepthFirstIterator.VisitColor>
- Returns:
true
if there are no more uniterated vertices in the currently iterated connected component;false
otherwise.
-
encounterVertex
protected void encounterVertex(V vertex, E edge)
Description copied from class:CrossComponentIterator
Update data structures the first time we see a vertex.- Specified by:
encounterVertex
in classCrossComponentIterator<V,E,DepthFirstIterator.VisitColor>
- Parameters:
vertex
- the vertex encounterededge
- the edge via which the vertex was encountered, or null if the vertex is a starting point
-
encounterVertexAgain
protected void encounterVertexAgain(V vertex, E edge)
Description copied from class:CrossComponentIterator
Called whenever we re-encounter a vertex. The default implementation does nothing.- Specified by:
encounterVertexAgain
in classCrossComponentIterator<V,E,DepthFirstIterator.VisitColor>
- Parameters:
vertex
- the vertex re-encounterededge
- the edge via which the vertex was re-encountered
-
provideNextVertex
protected V provideNextVertex()
Description copied from class:CrossComponentIterator
Returns the vertex to be returned in the following call to the iteratornext
method.- Specified by:
provideNextVertex
in classCrossComponentIterator<V,E,DepthFirstIterator.VisitColor>
- Returns:
- the next vertex to be returned by this iterator.
-
getStack
public java.util.Deque<java.lang.Object> getStack()
Retrieves the LIFO stack of vertices which have been encountered but not yet visited (WHITE). This stack also contains sentinel entries representing vertices which have been visited but are still GRAY. A sentinel entry is a sequence (v, SENTINEL), whereas a non-sentinel entry is just (v).- Returns:
- stack
-
-