Uses of Interface
org.jgrapht.traverse.GraphIterator
| Package | Description |
|---|---|
| org.jgrapht.traverse |
Graph traversal means.
|
-
Uses of GraphIterator in org.jgrapht.traverse
Classes in org.jgrapht.traverse that implement GraphIterator Modifier and Type Class Description classAbstractGraphIterator<V,E>An empty implementation of a graph iterator to minimize the effort required to implement graph iterators.classBreadthFirstIterator<V,E>A breadth-first iterator for a directed or undirected graph.classClosestFirstIterator<V,E>A closest-first iterator for a directed or undirected graph.classCrossComponentIterator<V,E,D>Provides a cross-connected-component traversal functionality for iterator subclasses.classDegeneracyOrderingIterator<V,E>A degeneracy ordering iterator.classDepthFirstIterator<V,E>A depth-first iterator for a directed or undirected graph.classLexBreadthFirstIterator<V,E>A lexicographical breadth-first iterator for an undirected graph.classMaximumCardinalityIterator<V,E>A maximum cardinality search iterator for an undirected graph.classRandomWalkIterator<V,E>Deprecated.UseRandomWalkVertexIteratorinstead.classTopologicalOrderIterator<V,E>A topological ordering iterator for a directed acyclic graph.