Uses of Package
org.jgrapht.traverse
-
Packages that use org.jgrapht.traverse Package Description org.jgrapht.alg Algorithms provided with JGraphT.org.jgrapht.traverse Graph traversal means. -
Classes in org.jgrapht.traverse used by org.jgrapht.alg Class Description AbstractGraphIterator An empty implementation of a graph iterator to minimize the effort required to implement graph iterators.ClosestFirstIterator A closest-first iterator for a directed or undirected graph.CrossComponentIterator Provides a cross-connected-component traversal functionality for iterator subclasses.DepthFirstIterator A depth-first iterator for a directed and an undirected graph.GraphIterator A graph iterator. -
Classes in org.jgrapht.traverse used by org.jgrapht.traverse Class Description AbstractGraphIterator An empty implementation of a graph iterator to minimize the effort required to implement graph iterators.AbstractGraphIterator.FlyweightEdgeEvent A reusable edge event.AbstractGraphIterator.FlyweightVertexEvent A reusable vertex event.AbstractGraphIterator.Specifics Provides unified interface for operations that are different in directed graphs and in undirected graphs.ClosestFirstIterator.QueueEntry Private data to associate with each entry in the priority queue.CrossComponentIterator Provides a cross-connected-component traversal functionality for iterator subclasses.CrossComponentIterator.VisitColor Standard vertex visit state enumeration.GraphIterator A graph iterator.