Uses of Interface
org.jgrapht.traverse.GraphIterator
-
Packages that use GraphIterator Package Description org.jgrapht.alg.cycle Algorithms related to graph cycles.org.jgrapht.traverse Graph traversal means. -
-
Uses of GraphIterator in org.jgrapht.alg.cycle
Classes in org.jgrapht.alg.cycle that implement GraphIterator 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.Fields in org.jgrapht.alg.cycle declared as GraphIterator Modifier and Type Field Description private GraphIterator<V,E>
ChordalityInspector. orderIterator
Iterator used for producing perfect elimination order. -
Uses of GraphIterator in org.jgrapht.traverse
Classes in org.jgrapht.traverse that implement GraphIterator Modifier and Type Class Description class
AbstractGraphIterator<V,E>
An empty implementation of a graph iterator to minimize the effort required to implement graph iterators.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.
-