Uses of Class
org.jgrapht.traverse.AbstractGraphIterator

Packages that use AbstractGraphIterator

Package	Description
org.jgrapht.alg.cycle	Algorithms related to graph cycles.
org.jgrapht.traverse	Graph traversal means.

Uses of AbstractGraphIterator in org.jgrapht.alg.cycle

Subclasses of AbstractGraphIterator in org.jgrapht.alg.cycle

Modifier and Type	Class	Description
private static class	CycleDetector.ProbeIterator<V,E>	Version of DFS which maintains a backtracking path used to probe for cycles.

Uses of AbstractGraphIterator in org.jgrapht.traverse

Subclasses of AbstractGraphIterator in org.jgrapht.traverse

Modifier and Type	Class	Description
class	BreadthFirstIterator<V,E>	A breadth-first iterator for a directed or undirected graph.
class	ClosestFirstIterator<V,E>	A closest-first iterator for a directed or undirected graph.
class	CrossComponentIterator<V,E,D>	Provides a cross-connected-component traversal functionality for iterator subclasses.
class	DegeneracyOrderingIterator<V,E>	A degeneracy ordering iterator.
class	DepthFirstIterator<V,E>	A depth-first iterator for a directed or undirected graph.
class	LexBreadthFirstIterator<V,E>	A lexicographical breadth-first iterator for an undirected graph.
class	MaximumCardinalityIterator<V,E>	A maximum cardinality search iterator for an undirected graph.
class	TopologicalOrderIterator<V,E>	A topological ordering iterator for a directed acyclic graph.