Modifier and Type | Method and Description |
---|---|
Graphable |
GraphGenerator.add(Object obj)
Adds an object to the graph.
|
Graphable |
GraphGenerator.get(Object obj)
Retrieves a component of the graph.
|
Graphable |
GraphGenerator.remove(Object obj)
Removes an object from the graph.
|
Modifier and Type | Method and Description |
---|---|
Graphable |
BasicGraphGenerator.add(Object obj) |
Graphable |
BasicGraphGenerator.get(Object obj) |
Graphable |
BasicGraphGenerator.remove(Object obj) |
Modifier and Type | Method and Description |
---|---|
Graphable |
FeatureGraphGenerator.add(Object obj) |
Graphable |
FeatureGraphGenerator.get(Object obj) |
Graphable |
FeatureGraphGenerator.remove(Object obj) |
Modifier and Type | Method and Description |
---|---|
Graphable |
BasicLineGraphGenerator.add(Object obj)
Adds a line to the graph.
|
Graphable |
LineStringGraphGenerator.add(Object obj) |
Graphable |
OptLineGraphGenerator.add(Object obj)
Adds a line to the graph.
|
Graphable |
OptDirectedLineGraphGenerator.add(Object obj)
Adds a line to the graph.
|
Graphable |
BasicLineGraphGenerator.get(Object obj)
Returns the edge which represents a line.
|
Graphable |
LineStringGraphGenerator.get(Object obj) |
Graphable |
OptLineGraphGenerator.get(Object obj)
Returns the edge which represents a line.
|
Graphable |
BasicLineGraphGenerator.remove(Object obj)
Removes the edge from the graph that represents a line.
|
Graphable |
LineStringGraphGenerator.remove(Object obj) |
Graphable |
OptLineGraphGenerator.remove(Object obj)
Unsupported operation.
|
Modifier and Type | Method and Description |
---|---|
Graphable |
PolygonGraphGenerator.add(Object obj) |
Graphable |
PolygonGraphGenerator.get(Object obj) |
Graphable |
PolygonGraphGenerator.remove(Object obj) |
Modifier and Type | Method and Description |
---|---|
double |
DijkstraShortestPathFinder.getCost(Graphable g)
Returns the cost associated with a node calculated during the graph traversal.
|
Path |
DijkstraShortestPathFinder.getPath(Graphable g)
Returns a path from g to the source.
|
int |
DijkstraShortestPathFinder.visit(Graphable element,
GraphTraversal traversal)
Does nothing except signal the traversal to continue.
|
int |
AStarShortestPathFinder.visit(Graphable element,
GraphTraversal traversal) |
Constructor and Description |
---|
DijkstraShortestPathFinder(Graph graph,
Graphable source,
DijkstraIterator.EdgeWeighter weighter)
Constructs a new path finder.
|
DijkstraShortestPathFinder(Graph graph,
Graphable source,
DijkstraIterator.EdgeWeighter weighter,
DijkstraIterator.NodeWeighter nweighter)
Constructs a new path finder.
|
Modifier and Type | Interface and Description |
---|---|
interface |
DirectedEdge
Represents an edge in a directed graph.
|
interface |
DirectedGraphable
Reperesents a component in a directed graph.
|
interface |
DirectedNode
Represents a node in a directed graph.
|
interface |
Edge
Represents an edge in Graph.
|
interface |
Node
Represents a node in a graph.
|
Modifier and Type | Method and Description |
---|---|
int |
GraphVisitor.visit(Graphable component)
Presents the visitor with the component to visit.
|
Modifier and Type | Class and Description |
---|---|
class |
BasicDirectedEdge
Basic implementation of DirectedEdge.
|
class |
BasicDirectedNode
Basic implementation of DirectedNode.
|
class |
BasicEdge
Basic implementation of Edge.
|
class |
BasicGraphable
Basic implementation of Graphable.
|
class |
BasicNode
Basic implementation of Node.
|
Modifier and Type | Interface and Description |
---|---|
interface |
XYNode
Represents a node in a line network.
|
Modifier and Type | Class and Description |
---|---|
class |
BasicDirectedXYNode
Basic implementation of a directed XYNode extended from BasicDirectedNode.
|
class |
BasicXYNode
Basic implementation of XYNode extended from BasicNode.
|
class |
OptDirectedXYNode
Optimized implementation of XYNode extended from OptDirectedNode.
|
class |
OptXYNode
Optimized implementation of XYNode extended from OptNode.
|
Modifier and Type | Class and Description |
---|---|
class |
OptDirectedEdge
Optimized implementation of DirectedEdge.
|
class |
OptDirectedNode
Optimized implementation of DirectedNode.
|
class |
OptEdge
Optimized implementation of Edge.
|
class |
OptGraphable
Root of class hierarchy for optimized implementation of graph components.
|
class |
OptNode
Optimized implementation of Node.
|
Modifier and Type | Method and Description |
---|---|
Graphable |
GraphIterator.next(GraphTraversal traversal)
Returns the next graph component in the iteration.
|
Modifier and Type | Method and Description |
---|---|
void |
GraphIterator.cont(Graphable current,
GraphTraversal traversal)
Signals to the iterator that iteration should continue from the current component in the
traversal.
|
boolean |
GraphTraversal.isVisited(Graphable g) |
void |
GraphIterator.killBranch(Graphable current,
GraphTraversal traversal)
Signals the iterator to kill the branch at the current component.
|
void |
GraphTraversal.setVisited(Graphable g,
boolean visited) |
int |
GraphWalker.visit(Graphable element,
GraphTraversal traversal)
Visits a graph component.
|
Modifier and Type | Method and Description |
---|---|
Graphable |
SourceGraphIterator.getSource()
Returns the source of the iteration.
|
Modifier and Type | Method and Description |
---|---|
boolean |
BasicGraphTraversal.isVisited(Graphable g) |
boolean |
StagedGraphTraversal.isVisited(Graphable g) |
void |
SourceGraphIterator.setSource(Graphable source)
Sets the source for the iteration.
|
void |
BasicGraphTraversal.setVisited(Graphable g,
boolean visited) |
void |
StagedGraphTraversal.setVisited(Graphable g,
boolean visited) |
int |
CountingWalker.visit(Graphable element,
GraphTraversal traversal)
Sets the count of the component and increments the counter.
|
int |
DummyGraphWalker.visit(Graphable element,
GraphTraversal traversal)
Returns the continue signal.
|
int |
SimpleGraphWalker.visit(Graphable element,
GraphTraversal traversal)
Defers to the underlying visitor.
|
Modifier and Type | Field and Description |
---|---|
protected HashMap<Graphable,DijkstraIterator.DijkstraNode> |
DijkstraIterator.nodemap
map of graph node to internal dijkstra node *
|
Modifier and Type | Method and Description |
---|---|
Graphable |
DijkstraIterator.getParent(Graphable component)
Returns the last node in the known set to update the node.
|
Graphable |
NoBifurcationIterator.next(GraphTraversal traversal)
The next node in the iteration is the first node found adjacent to the current node that is
non visited and of degree less than 2.
|
Graphable |
BreadthFirstIterator.next(GraphTraversal traversal)
Returns the next node from the node queue that has not yet been visited.
|
Graphable |
AStarIterator.next(GraphTraversal traversal)
Returns the next node in the priority queue. if the queue is empty then there is no path from
the source to the destiny in this graph.
|
Graphable |
BreadthFirstTopologicalIterator.next(GraphTraversal traversal)
Returns the next node in the active node queue.
|
Graphable |
DirectedBreadthFirstTopologicalIterator.next(GraphTraversal traversal) |
Graphable |
DijkstraIterator.next(GraphTraversal traversal)
Returns the next node in the priority queue.
|
Modifier and Type | Method and Description |
---|---|
void |
DirectedDepthFirstIterator.cont(Graphable current,
GraphTraversal traversal) |
void |
NoBifurcationIterator.cont(Graphable current,
GraphTraversal traversal)
Searches for the next node to be returned in the iteration.
|
void |
BreadthFirstIterator.cont(Graphable current,
GraphTraversal traversal)
Looks for nodes adjacent to the current node to place into the node queue.
|
void |
AStarIterator.cont(Graphable current,
GraphTraversal traversal)
Makes a step of the A* algorithm.
|
void |
DirectedBreadthFirstIterator.cont(Graphable current,
GraphTraversal traversal) |
void |
BreadthFirstTopologicalIterator.cont(Graphable current,
GraphTraversal traversal)
Continues the iteration by incrementing the counters of any unvisited nodes related to the
current node.
|
void |
DirectedBreadthFirstTopologicalIterator.cont(Graphable current,
GraphTraversal traversal) |
void |
DijkstraIterator.cont(Graphable current,
GraphTraversal traversal)
Looks for adjacent nodes to the current node which are in the adjacent node and updates
costs.
|
double |
DijkstraIterator.getCost(Graphable component)
Returns the internal cost of a node which has been calculated by the iterator.
|
Graphable |
DijkstraIterator.getParent(Graphable component)
Returns the last node in the known set to update the node.
|
protected Iterator |
AStarIterator.getRelated(Graphable current) |
protected Iterator |
DirectedDijkstraIterator.getRelated(Graphable current) |
protected Iterator |
DijkstraIterator.getRelated(Graphable current) |
void |
NoBifurcationIterator.killBranch(Graphable current,
GraphTraversal traversal)
Kills the current branch of the iteration by explicitly setting the next node to be returned
to null.
|
void |
BreadthFirstIterator.killBranch(Graphable current,
GraphTraversal traversal)
Kills the current branch by not looking for any adjacent nodes to place into the node queue.
|
void |
AStarIterator.killBranch(Graphable current,
GraphTraversal traversal)
Kills the branch of the traversal
|
void |
BreadthFirstTopologicalIterator.killBranch(Graphable current,
GraphTraversal traversal)
Kills the current branch of the traversal by not incremening the counters of any related
nodes.
|
void |
DirectedBreadthFirstTopologicalIterator.killBranch(Graphable current,
GraphTraversal traversal) |
void |
DijkstraIterator.killBranch(Graphable current,
GraphTraversal traversal)
Kills the branch of the traversal by not updating the cost of any adjacent nodes.
|
void |
NoBifurcationIterator.setSource(Graphable source)
Sets the source of the traversal.
|
void |
BreadthFirstIterator.setSource(Graphable source)
Sets the source of the traversal and places it in the node queue.
|
Modifier and Type | Class and Description |
---|---|
class |
DelaunayEdge |
class |
DelaunayNode |
Modifier and Type | Method and Description |
---|---|
int |
GraphPartitioner.visit(Graphable element,
GraphTraversal traversal)
Adds the element to the current partition.
|
int |
CycleDetector.visit(Graphable element,
GraphTraversal traversal)
Increments the count of nodes visited.
|
Copyright © 1996–2019 Geotools. All rights reserved.