Uses of Package
org.jgrapht.traverse
Packages that use org.jgrapht.traverse
Package
Description
Algorithms related to graph cycles.
Shortest-path related algorithms.
Graph traversal means.
-
Classes in org.jgrapht.traverse used by org.jgrapht.alg.cycleClassDescriptionAn empty implementation of a graph iterator to minimize the effort required to implement graph iterators.Provides a cross-connected-component traversal functionality for iterator subclasses.A depth-first iterator for a directed or undirected graph.A graph iterator.
-
Classes in org.jgrapht.traverse used by org.jgrapht.alg.shortestpath
-
Classes in org.jgrapht.traverse used by org.jgrapht.traverseClassDescriptionAn empty implementation of a graph iterator to minimize the effort required to implement graph iterators.A reusable edge event.A reusable vertex event.Data kept for discovered vertices.Private data to associate with each entry in the priority queue.Provides a cross-connected-component traversal functionality for iterator subclasses.Standard vertex visit state enumeration.A graph iterator.Data structure for performing lexicographical breadth-first search.Plays the role of the container of vertices.