Module org.jgrapht.core
Package org.jgrapht.traverse
package org.jgrapht.traverse
Graph traversal means.

ClassDescriptionAn empty implementation of a graph iterator to minimize the effort required to implement graph iterators.BreadthFirstIterator<V,
E> A breadthfirst iterator for a directed or undirected graph.Data kept for discovered vertices.ClosestFirstIterator<V,E> A closestfirst iterator for a directed or undirected graph.CrossComponentIterator<V,E, D> Provides a crossconnectedcomponent traversal functionality for iterator subclasses.A degeneracy ordering iterator.DepthFirstIterator<V,E> A depthfirst iterator for a directed or undirected graph.Standard vertex visit state enumeration.GraphIterator<V,E> A graph iterator.A lexicographical breadthfirst iterator for an undirected graph.A maximum cardinality search iterator for an undirected graph.An exception to signal thatTopologicalOrderIterator
is used for a nondirected acyclic graph.A random walk iterator.A topological ordering iterator for a directed acyclic graph.