Package | Description |
---|---|
org.geotools.graph.path | |
org.geotools.graph.traverse | |
org.geotools.graph.traverse.basic | |
org.geotools.graph.util.graph |
Modifier and Type | Class and Description |
---|---|
class |
AStarShortestPathFinder
Calculates the shortest path between two nodes using the A Star algorithm (for details see
http://en.wikipedia.org/wiki/A_star)
|
class |
DijkstraShortestPathFinder
Calculates node paths in a graph using Dijkstra's Shortest Path Algorithm.
|
Modifier and Type | Method and Description |
---|---|
GraphWalker |
GraphTraversal.getWalker()
Returns the walker (visitor) traversing the graph of the graph.
|
Modifier and Type | Method and Description |
---|---|
void |
GraphTraversal.setWalker(GraphWalker walker)
Sets the walker (visitor) traversing the graph.
|
Modifier and Type | Class and Description |
---|---|
class |
CountingWalker
An implementation of GraphWalker that counts the number of components visited.
|
class |
DummyGraphWalker
A simple implementation of GraphWalker that does nothing but signal a graph traversal to
continue.
|
class |
SimpleGraphWalker
A simple implementation of GraphWalker that decorates a GraphVisitor.
|
Modifier and Type | Method and Description |
---|---|
GraphWalker |
AbstractGraphIterator.getWalker()
Returns the walker being traversed over the graph.
|
GraphWalker |
BasicGraphTraversal.getWalker() |
Modifier and Type | Method and Description |
---|---|
void |
BasicGraphTraversal.setWalker(GraphWalker walker) |
Constructor and Description |
---|
BasicGraphTraversal(Graph graph,
GraphWalker walker,
GraphIterator iterator)
Constructs a new graph traversal.
|
StagedGraphTraversal(Graph graph,
GraphWalker walker,
GraphIterator iterator) |
Modifier and Type | Class and Description |
---|---|
class |
CycleDetector
Detects cycles in a graph.
|
class |
DirectedCycleDetector
Detects cycles in a directed graph.
|
class |
GraphPartitioner
Creates a collection of connected graphs from a single graph.
|
Copyright © 1996–2019 Geotools. All rights reserved.