Package org.jgrapht.traverse
Graph traversal means.

Interface Summary Interface Description GraphIterator<V,E> A graph iterator. 
Class Summary Class Description AbstractGraphIterator<V,E> An empty implementation of a graph iterator to minimize the effort required to implement graph iterators.BreadthFirstIterator<V,E> A breadthfirst iterator for a directed or undirected graph.BreadthFirstIterator.SearchNodeData<E> Data kept for discovered vertices.ClosestFirstIterator<V,E> A closestfirst iterator for a directed or undirected graph.CrossComponentIterator<V,E,D> Provides a crossconnectedcomponent traversal functionality for iterator subclasses.DegeneracyOrderingIterator<V,E> A degeneracy ordering iterator.DepthFirstIterator<V,E> A depthfirst iterator for a directed or undirected graph.LexBreadthFirstIterator<V,E> A lexicographical breadthfirst iterator for an undirected graph.MaximumCardinalityIterator<V,E> A maximum cardinality search iterator for an undirected graph.RandomWalkIterator<V,E> A random walk iterator for a directed or undirected graph.TopologicalOrderIterator<V,E> A topological ordering iterator for a directed acyclic graph. 
Enum Summary Enum Description DepthFirstIterator.VisitColor Standard vertex visit state enumeration.