Package org.jgrapht.traverse
Graph traversal means.
-
Interface Summary Interface Description CrossComponentIterator.SimpleContainer<T> 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.AbstractGraphIterator.DirectedSpecifics<VV,EE> An implementation ofAbstractGraphIterator.Specifics
for a directed graph.AbstractGraphIterator.FlyweightEdgeEvent<VV,localE> A reusable edge event.AbstractGraphIterator.FlyweightVertexEvent<VV> A reusable vertex event.AbstractGraphIterator.Specifics<VV,EE> Provides unified interface for operations that are different in directed graphs and in undirected graphs.AbstractGraphIterator.UndirectedSpecifics<VV,EE> An implementation ofAbstractGraphIterator.Specifics
in which edge direction (if any) is ignored.BreadthFirstIterator<V,E> A breadth-first iterator for a directed and an undirected graph.ClosestFirstIterator<V,E> A closest-first iterator for a directed or undirected graph.ClosestFirstIterator.QueueEntry<V,E> Private data to associate with each entry in the priority queue.CrossComponentIterator<V,E,D> Provides a cross-connected-component traversal functionality for iterator subclasses.DepthFirstIterator<V,E> A depth-first iterator for a directed and an undirected graph.RandomWalkIterator<V,E> A random-walk iterator for a directed and an undirected graph.TopologicalOrderIterator<V,E> Implements topological order traversal for a directed acyclic graph.TopologicalOrderIterator.LinkedListQueue<T> -
Enum Summary Enum Description CrossComponentIterator.VisitColor Standard vertex visit state enumeration.