Modifier and Type | Method and Description |
---|---|
Node |
GraphBuilder.buildNode()
Builds a new node for the graph.
|
Modifier and Type | Method and Description |
---|---|
void |
GraphBuilder.addNode(Node node)
Adds a node to the graph.
|
Edge |
GraphBuilder.buildEdge(Node nodeA,
Node nodeB)
Builds a new edge for the graph.
|
void |
GraphBuilder.removeNode(Node node)
Removes an node from the graph.
|
Modifier and Type | Method and Description |
---|---|
Node |
BasicGraphBuilder.buildNode() |
Node |
BasicDirectedGraphBuilder.buildNode()
Builds a directed node.
|
Modifier and Type | Method and Description |
---|---|
void |
BasicGraphBuilder.addNode(Node node) |
Edge |
BasicGraphBuilder.buildEdge(Node nodeA,
Node nodeB) |
Edge |
BasicDirectedGraphBuilder.buildEdge(Node nodeA,
Node nodeB)
Builds a directed edge.
|
void |
BasicGraphBuilder.removeNode(Node node) |
Modifier and Type | Method and Description |
---|---|
Node |
OptDirectedLineGraphBuilder.buildNode()
Returns a node of type OptDirectedXYNode.
|
Node |
BasicDirectedLineGraphBuilder.buildNode()
Returns a node of type BasicDirectedXYNode.
|
Node |
BasicLineGraphBuilder.buildNode()
Returns a node of type BasicXYNode.
|
Node |
OptLineGraphBuilder.buildNode()
Returns a node of type OptXYNode.
|
Node |
BasicLineGraphGenerator.getNode(Coordinate c) |
Node |
OptLineGraphGenerator.getNode(Coordinate c) |
Node |
LineGraphGenerator.getNode(Coordinate coordinate)
Look up a Node for the provided coordinate.
|
Node |
OptDirectedLineGraphGenerator.getNode(Coordinate c) |
Modifier and Type | Method and Description |
---|---|
protected LineSegment |
BasicLineGraphGenerator.alterLine(LineSegment line,
Node n1,
Node n2) |
protected LineSegment |
LineStringGraphGenerator.alterLine(LineSegment line,
Node n1,
Node n2) |
protected void |
BasicLineGraphGenerator.setObject(Node n,
Object obj) |
protected void |
LineStringGraphGenerator.setObject(Node n,
Object obj) |
Modifier and Type | Method and Description |
---|---|
Node |
OptGraphBuilder.buildNode()
Creates an optimized node.
|
Node |
OptDirectedGraphBuilder.buildNode()
Creates an optimized directed node.
|
Modifier and Type | Method and Description |
---|---|
Edge |
OptGraphBuilder.buildEdge(Node nodeA,
Node nodeB)
Creates an optimized edge.
|
Edge |
OptDirectedGraphBuilder.buildEdge(Node nodeA,
Node nodeB)
Creates an optimized directed edge.
|
Modifier and Type | Method and Description |
---|---|
protected Node |
PolygonGraphGenerator.find(Polygon polygon) |
Modifier and Type | Method and Description |
---|---|
protected void |
PolygonGraphGenerator.relate(Node node) |
Modifier and Type | Method and Description |
---|---|
protected void |
DBReaderWriter.writeNode(Statement st,
Node node)
Template method used to write a node into the database.
|
protected void |
TextfileReaderWriter.writeNode(Writer out,
Node n)
Template method for writing the text representation of a node to an text file.
|
Modifier and Type | Method and Description |
---|---|
Node |
Walk.getFirst() |
Node |
NodeSequence.getFirst()
Returns the first node in the sequence.
|
Node |
Walk.getLast() |
Node |
NodeSequence.getLast()
Returns the last node in the sequence.
|
Modifier and Type | Method and Description |
---|---|
boolean |
Walk.add(Node node)
Adds a node to the walk.
|
Path |
ExhaustivePathFinder.getPath(Node from,
Node to) |
List |
ExhaustivePathFinder.getPaths(Node from,
GraphVisitor visitor) |
List |
ExhaustivePathFinder.getPaths(Node from,
Node to) |
void |
Walk.remove(Node node)
Removes a node from the walk.
|
Constructor and Description |
---|
AStarShortestPathFinder(Graph graph,
Node source,
Node target,
AStarIterator.AStarFunctions afuncs)
Constructs a new path finder
|
Modifier and Type | Interface and Description |
---|---|
interface |
DirectedNode
Represents a node in a directed graph.
|
Modifier and Type | Method and Description |
---|---|
Node |
Edge.getNodeA()
Returns the A node of the edge.
|
Node |
Edge.getNodeB()
Returns the B node of the edge.
|
Node |
Edge.getOtherNode(Node node)
Returns one of the two nodes of an edge.
|
Modifier and Type | Method and Description |
---|---|
Edge |
Node.getEdge(Node other)
Returns an edge in the adjacency list of the node that is adjacent to another specified node.
|
List |
Node.getEdges(Node other)
Returns a collection of edges in the adjacency list of the node that are adjacent to another
specified node.
|
Node |
Edge.getOtherNode(Node node)
Returns one of the two nodes of an edge.
|
Modifier and Type | Class and Description |
---|---|
class |
BasicDirectedNode
Basic implementation of DirectedNode.
|
class |
BasicNode
Basic implementation of Node.
|
Modifier and Type | Method and Description |
---|---|
Node |
BasicEdge.getNodeA() |
Node |
BasicDirectedEdge.getNodeA()
Returns the in node.
|
Node |
BasicEdge.getNodeB() |
Node |
BasicDirectedEdge.getNodeB()
Returns the out node.
|
Node |
BasicEdge.getOtherNode(Node node)
Returns null if the specified node is neither the A node or the B node.
|
Node |
BasicDirectedEdge.getOtherNode(Node node) |
Modifier and Type | Method and Description |
---|---|
Edge |
BasicDirectedNode.getEdge(Node other)
First searches for an in edge with an out node == this, and in node == other.
|
Edge |
BasicNode.getEdge(Node other) |
List |
BasicDirectedNode.getEdges(Node other)
A combination of the results of getInEdges(Node) and getOutEdges(Node).
|
List |
BasicNode.getEdges(Node other) |
Node |
BasicEdge.getOtherNode(Node node)
Returns null if the specified node is neither the A node or the B node.
|
Node |
BasicDirectedEdge.getOtherNode(Node node) |
Constructor and Description |
---|
BasicEdge(Node nodeA,
Node nodeB)
Constructs a new edge.
|
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 |
OptDirectedNode
Optimized implementation of DirectedNode.
|
class |
OptNode
Optimized implementation of Node.
|
Modifier and Type | Method and Description |
---|---|
Node |
OptEdge.getNodeA() |
Node |
OptDirectedEdge.getNodeA() |
Node |
OptEdge.getNodeB() |
Node |
OptDirectedEdge.getNodeB() |
Node |
OptEdge.getOtherNode(Node node) |
Node |
OptDirectedEdge.getOtherNode(Node node) |
Modifier and Type | Method and Description |
---|---|
Edge |
OptNode.getEdge(Node other) |
Edge |
OptDirectedNode.getEdge(Node other) |
List |
OptNode.getEdges(Node other) |
List |
OptDirectedNode.getEdges(Node other) |
Node |
OptEdge.getOtherNode(Node node) |
Node |
OptDirectedEdge.getOtherNode(Node node) |
Modifier and Type | Field and Description |
---|---|
Node |
DijkstraIterator.DijkstraNode.node
underlying graph node *
|
Modifier and Type | Method and Description |
---|---|
Node |
AStarIterator.AStarFunctions.getDest() |
Node |
AStarIterator.AStarNode.getNode() |
Node |
AStarIterator.getParent(Node n) |
Modifier and Type | Method and Description |
---|---|
Node |
AStarIterator.getParent(Node n) |
double |
DijkstraIterator.NodeWeighter.getWeight(Node n,
Edge e1,
Edge e2)
Returns the weight for a node, with respect to two adjecent edges.
|
abstract double |
AStarIterator.AStarFunctions.h(Node n)
Defines the heuristic function for n
|
void |
AStarIterator.AStarFunctions.setDestination(Node destination)
Sets up the destination node for the algorithm
|
void |
AStarIterator.AStarNode.setNode(Node n) |
Constructor and Description |
---|
AStarFunctions(Node destination)
Creates a new instance and sets up the destination node for the algorithm
|
AStarIterator(Node source,
AStarIterator.AStarFunctions afuncs) |
AStarNode(Node n,
double h_val) |
DijkstraNode(Node node,
double cost)
Constructs a new Dijsktra node.
|
Modifier and Type | Class and Description |
---|---|
class |
DelaunayNode |
Modifier and Type | Method and Description |
---|---|
Node[] |
Triangle.getNodes() |
Node |
Triangle.getThirdNode(Edge e) |
Modifier and Type | Method and Description |
---|---|
static Vector |
AutoClustUtils.findAdjacentEdges(Node node,
Collection edges) |
Edge |
Triangle.getOppositeEdge(Node n) |
Copyright © 1996–2019 Geotools. All rights reserved.