Package  Description 

org.jgrapht.traverse 
Graph traversal means.

Modifier and Type  Class and 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 breadthfirst iterator for a directed or undirected graph.

class 
ClosestFirstIterator<V,E>
A closestfirst iterator for a directed or undirected graph.

class 
CrossComponentIterator<V,E,D>
Provides a crossconnectedcomponent traversal functionality for iterator subclasses.

class 
DegeneracyOrderingIterator<V,E>
A degeneracy ordering iterator.

class 
DepthFirstIterator<V,E>
A depthfirst iterator for a directed or undirected graph.

class 
LexBreadthFirstIterator<V,E>
A lexicographical breadthfirst iterator for an undirected graph.

class 
MaximumCardinalityIterator<V,E>
A maximum cardinality search iterator for an undirected graph.

class 
RandomWalkIterator<V,E>
A random walk iterator for a directed or undirected graph.

class 
TopologicalOrderIterator<V,E>
A topological ordering iterator for a directed acyclic graph.

Copyright © 2018. All rights reserved.