Package | Description |
---|---|
org.geotools.graph.traverse.standard |
Modifier and Type | Class and Description |
---|---|
class |
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:
The path-cost function (usually denoted g(x), which may or may not be a heuristic)
An admissible "heuristic estimate" (usually denoted h(x)).
|
class |
BreadthFirstIterator
Iterates over the nodes of a graph in a Breadth First Search pattern starting from a
specified node.
|
class |
DepthFirstIterator
Iterates over the nodes of a graph in a Depth First Search pattern starting from a
specified node.
|
class |
DijkstraIterator
Iterates over the nodes of a graph in pattern using Dijkstra's Shortest Path Algorithm.
|
class |
DirectedBreadthFirstIterator |
class |
DirectedDepthFirstIterator |
class |
DirectedDijkstraIterator |
class |
NoBifurcationIterator
Iterates over the nodes of a graph starting from a specified node, stopping at a bifurcation.
|
Copyright © 1996–2019 Geotools. All rights reserved.