|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use SourceGraphIterator | |
---|---|
org.geotools.graph.traverse.standard |
Uses of SourceGraphIterator in org.geotools.graph.traverse.standard |
---|
Subclasses of SourceGraphIterator in org.geotools.graph.traverse.standard | |
---|---|
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. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |