Uses of Interface
org.jgrapht.traverse.GraphIterator
Packages that use GraphIterator
Package
Description
Algorithms related to graph cycles.
Graph traversal means.
-
Uses of GraphIterator in org.jgrapht.alg.cycle
Classes in org.jgrapht.alg.cycle that implement GraphIteratorModifier and TypeClassDescriptionprivate static class
Version of DFS which maintains a backtracking path used to probe for cycles.Fields in org.jgrapht.alg.cycle declared as GraphIteratorModifier and TypeFieldDescriptionprivate final 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 GraphIteratorModifier and TypeClassDescriptionclass
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
A degeneracy ordering iterator.class
DepthFirstIterator<V,
E> A depth-first iterator for a directed or undirected graph.class
A lexicographical breadth-first iterator for an undirected graph.class
A maximum cardinality search iterator for an undirected graph.class
A topological ordering iterator for a directed acyclic graph.