Name | Description | Type | Package | Framework |
AbstractGraphIterator | An empty implementation of a graph iterator to minimize the effort required to implement graph iterators. | Class | org.jscience.computing.graph.iterators | JScience |
BreadthFirstIterator | A breadth-first iterator for a directed and an undirected graph. | Class | org.jscience.computing.graph.iterators | JScience |
ClosestFirstIterator | A closest-first iterator for a directed or undirected graph. | Class | org.jscience.computing.graph.iterators | JScience |
CrossComponentIterator | Provides a cross-connected-component traversal functionality for iterator subclasses. | Class | org.jscience.computing.graph.iterators | JScience |
DepthFirstIterator | A depth-first iterator for a directed and an undirected graph. | Class | org.jscience.computing.graph.iterators | JScience |
GraphIterator | Interface | org.jscience.computing.graph.iterators | JScience | |
TopologicalOrderIterator | sort is a permutation p of the vertices of a graph such that an edge (i,j) implies that i appears before j in | Class | org.jscience.computing.graph.iterators | JScience |