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 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.Standard vertex visit state enumeration.DepthFirstIterator<V,E> A depth-first iterator for a directed and an undirected graph.GraphIterator<V,E> A graph iterator.Implements topological order traversal for a directed acyclic graph.