Package org.jgrapht.traverse

Graph traversal means.

See:
          Description

Interface Summary
GraphIterator<V,E> A graph iterator.
 

Class Summary
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 and an undirected graph.
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.
DepthFirstIterator<V,E> A depth-first iterator for a directed and an undirected graph.
TopologicalOrderIterator<V,E> Implements topological order traversal for a directed acyclic graph.
 

Enum Summary
CrossComponentIterator.VisitColor Standard vertex visit state enumeration.
 

Package org.jgrapht.traverse Description

Graph traversal means.