Name | Description | Type | Package | Framework |
AbstractGraphIterator | An abstract implementation of GraphIterator. | Class | org.geotools.graph.traverse.basic | GeoTools |
AStarIterator | A path iterator that uses a function (usually denoted f(x)) to determine the order in which the algorithm visits nodes, f(x) is a sum of two functions: | Class | org.geotools.graph.traverse.standard | GeoTools |
AStarIterator .AStarFunctions | Defines the functions needed by A Star. | Class | org.geotools.graph.traverse.standard.AStarIterator | GeoTools |
AStarIterator .AStarNode | Internal data structure used to track node costs, and parent nodes. | Class | org.geotools.graph.traverse.standard.AStarIterator | GeoTools |
BasicGraphTraversal | A basic implementation of GraphTraversal. | Class | org.geotools.graph.traverse.basic | GeoTools |
BreadthFirstIterator | Iterates over the nodes of a graph in a Breadth First Search pattern starting from a specified node. | Class | org.geotools.graph.traverse.standard | GeoTools |
BreadthFirstTopologicalIterator | Iterates over the nodes of a graph in Breadth First Topological Sort pattern. | Class | org.geotools.graph.traverse.standard | GeoTools |
CountingWalker | An implementation of GraphWalker that counts the number of components visited. | Class | org.geotools.graph.traverse.basic | GeoTools |
DepthFirstIterator | Iterates over the nodes of a graph in a Depth First Search pattern starting from a specified node. | Class | org.geotools.graph.traverse.standard | GeoTools |
DepthFirstTopologicalIterator | Iterates over the nodes of a graph in Depth First Topological Sort pattern. | Class | org.geotools.graph.traverse.standard | GeoTools |
DijkstraIterator | Iterates over the nodes of a graph in pattern using Dijkstra's Shortest Path Algorithm. | Class | org.geotools.graph.traverse.standard | GeoTools |
DijkstraIterator .DijkstraNode | Internal data structure used to track node costs, and parent nodes. | Class | org.geotools.graph.traverse.standard.DijkstraIterator | GeoTools |
DijkstraIterator .EdgeWeighter | Supplies a weight for each edge in the graph to be used by the iteration when calculating node costs. | Interface | org.geotools.graph.traverse.standard.DijkstraIterator | GeoTools |
DijkstraIterator .NodeWeighter | Supplies a weight for each pair of adjacent edges. | Interface | org.geotools.graph.traverse.standard.DijkstraIterator | GeoTools |
DirectedBreadthFirstIterator | Class | org.geotools.graph.traverse.standard | GeoTools | |
DirectedBreadthFirstTopologicalIterator | Class | org.geotools.graph.traverse.standard | GeoTools | |
DirectedDepthFirstIterator | Class | org.geotools.graph.traverse.standard | GeoTools | |
DirectedDepthFirstTopologicalIterator | Class | org.geotools.graph.traverse.standard | GeoTools | |
DirectedDijkstraIterator | Class | org.geotools.graph.traverse.standard | GeoTools | |
DummyGraphWalker | A simple implementation of GraphWalker that does nothing but signal a graph traversal to continue. | Class | org.geotools.graph.traverse.basic | GeoTools |
GraphIterator | Defines an algorithm in which to traverse the components of a graph. | Interface | org.geotools.graph.traverse | GeoTools |
GraphTraversal | Iterates a GraphWalker over the components of a Graph. | Interface | org.geotools.graph.traverse | GeoTools |
GraphWalker | Iterated over the components of a graph using a standard visitor Author:Justin Deoliveira, Refractions Research Inc, jdeolive@refractions. | Interface | org.geotools.graph.traverse | GeoTools |
NoBifurcationIterator | Iterates over the nodes of a graph starting from a specified node, stopping at a bifurcation. | Class | org.geotools.graph.traverse.standard | GeoTools |
SimpleGraphWalker | A simple implementation of GraphWalker that decorates a GraphVisitor. | Class | org.geotools.graph.traverse.basic | GeoTools |
SourceGraphIterator | A GraphIterator that starts iteration from a specefied point. | Class | org.geotools.graph.traverse.basic | GeoTools |
StagedGraphTraversal | Class | org.geotools.graph.traverse.basic | GeoTools | |