Uses of Package
org.jgrapht.traverse
-
Packages that use org.jgrapht.traverse Package Description org.jgrapht.alg.cycle Algorithms related to graph cycles.org.jgrapht.alg.shortestpath Shortest-path related algorithms.org.jgrapht.traverse Graph traversal means. -
Classes in org.jgrapht.traverse used by org.jgrapht.alg.cycle Class Description AbstractGraphIterator An empty implementation of a graph iterator to minimize the effort required to implement graph iterators.CrossComponentIterator Provides a cross-connected-component traversal functionality for iterator subclasses.DepthFirstIterator A depth-first iterator for a directed or undirected graph.GraphIterator A graph iterator. -
Classes in org.jgrapht.traverse used by org.jgrapht.alg.shortestpath Class Description BreadthFirstIterator A breadth-first iterator for a directed or undirected graph. -
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.ClosestFirstIterator.QueueEntry Private data to associate with each entry in the priority queue.CrossComponentIterator Provides a cross-connected-component traversal functionality for iterator subclasses.DepthFirstIterator.VisitColor Standard vertex visit state enumeration.GraphIterator A graph iterator.LexBreadthFirstIterator.BucketList Data structure for performing lexicographical breadth-first search.LexBreadthFirstIterator.BucketList.Bucket Plays the role of the container of vertices.