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 breadth-first iterator for a directed or undirected graph. BreadthFirstIterator.SearchNodeData<E>Data kept for discovered vertices. ClosestFirstIterator<V,E>A closest-first iterator for a directed or undirected graph. CrossComponentIterator<V,E,D>Provides a cross-connected-component traversal functionality for iterator subclasses. DegeneracyOrderingIterator<V,E>A degeneracy ordering iterator. DepthFirstIterator<V,E>A depth-first iterator for a directed or undirected graph. LexBreadthFirstIterator<V,E>A lexicographical breadth-first iterator for an undirected graph. MaximumCardinalityIterator<V,E>A maximum cardinality search iterator for an undirected graph. RandomWalkVertexIterator<V,E>A random walk iterator. TopologicalOrderIterator<V,E>A topological ordering iterator for a directed acyclic graph.
Enum Summary Enum Description DepthFirstIterator.VisitColorStandard vertex visit state enumeration.
Exception Summary Exception Description NotDirectedAcyclicGraphExceptionAn exception to signal that
TopologicalOrderIteratoris used for a non-directed acyclic graph.