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 and an 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 |
DepthFirstIterator<V,E> |
A depth-first iterator for a directed and an undirected graph.
|
class |
RandomWalkIterator<V,E> |
A random-walk
iterator for a directed and an undirected graph.
|
class |
TopologicalOrderIterator<V,E> |
Implements topological order traversal for a directed acyclic graph.
|