Modifier and Type | Method and Description |
---|---|
Edge |
GraphBuilder.buildEdge(Node nodeA,
Node nodeB)
Builds a new edge for the graph.
|
Modifier and Type | Method and Description |
---|---|
void |
GraphBuilder.addEdge(Edge edge)
Adds an edge to the graph.
|
void |
GraphBuilder.removeEdge(Edge edge)
Removes an edge from the graph.
|
Modifier and Type | Method and Description |
---|---|
Edge |
BasicGraphBuilder.buildEdge(Node nodeA,
Node nodeB) |
Edge |
BasicDirectedGraphBuilder.buildEdge(Node nodeA,
Node nodeB)
Builds a directed edge.
|
Modifier and Type | Method and Description |
---|---|
Collection<Edge> |
BasicGraphBuilder.getEdges()
Returns the edges belonging to the graph being built.
|
Modifier and Type | Method and Description |
---|---|
void |
BasicGraphBuilder.addEdge(Edge edge)
Checks for loops in which case it only added the edge to the adjacency list of one of the
nodes (both of its nodes are the same node).
|
void |
BasicDirectedGraphBuilder.addEdge(Edge edge)
Adds a directed edge to the graph.
|
void |
BasicGraphBuilder.removeEdge(Edge edge) |
Modifier and Type | Method and Description |
---|---|
protected Edge |
OptDirectedLineGraphGenerator.generateEdge(LineSegment line) |
protected Edge |
OptLineGraphGenerator.generateEdge(LineSegment line) |
Edge |
OptDirectedLineGraphGenerator.getEdge(Coordinate c1,
Coordinate c2) |
Edge |
LineGraphGenerator.getEdge(Coordinate coordinate1,
Coordinate coordinate2)
Retrieve edge between the two coordinates.
|
Edge |
BasicLineGraphGenerator.getEdge(Coordinate c1,
Coordinate c2) |
Edge |
OptLineGraphGenerator.getEdge(Coordinate c1,
Coordinate c2) |
Modifier and Type | Method and Description |
---|---|
protected void |
BasicLineGraphGenerator.setObject(Edge e,
Object obj) |
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 void |
DBReaderWriter.writeEdge(Statement st,
Edge edge)
Template method used to write an edge into the database.
|
protected void |
TextfileReaderWriter.writeEdge(Writer out,
Edge e)
Template method for writing the text representation of an edge to an text file.
|
Modifier and Type | Method and Description |
---|---|
protected List<Edge> |
Walk.buildEdges()
Internal method for building the edge set of the walk.
|
protected List<Edge> |
Cycle.buildEdges() |
List<Edge> |
Walk.getEdges()
Calculates the edges in the walk.
|
Modifier and Type | Method and Description |
---|---|
boolean |
Walk.addEdge(Edge e) |
Modifier and Type | Method and Description |
---|---|
void |
Walk.addEdges(Collection<Edge> edges) |
Modifier and Type | Interface and Description |
---|---|
interface |
DirectedEdge
Represents an edge in a directed graph.
|
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.
|
Edge |
DirectedNode.getInEdge(DirectedNode other)
Returns an edge that terminates at the node and originates from a specified node.
|
Edge |
DirectedNode.getOutEdge(DirectedNode other)
Returns an edge that originates at the node and terminates at a specified node.
|
Modifier and Type | Method and Description |
---|---|
List<? extends Edge> |
Node.getEdges()
Returns the edge adjacency list of the node.
|
Collection<Edge> |
Graph.getEdges()
Returns the edges of the graph.
|
List<? extends Edge> |
Node.getEdges(Node other)
Returns a collection of edges in the adjacency list of the node that are adjacent to another
specified node.
|
List<? extends Edge> |
DirectedNode.getInEdges()
Returns the in adjacency list of the node.
|
List<? extends Edge> |
DirectedNode.getInEdges(DirectedNode other)
Returns all edges that terminate at the node and originate from a specified node.
|
List<? extends Edge> |
DirectedNode.getOutEdges()
Returns the out adjacency list of the node.
|
List<? extends Edge> |
DirectedNode.getOutEdges(DirectedNode other)
Returns all edges that originate at the node and terminate from at specified node.
|
List<Edge> |
Graph.getVisitedEdges(boolean visited)
Returns all the edges in the graph that have been marked as visited or non-visited.
|
Modifier and Type | Method and Description |
---|---|
void |
Node.add(Edge e)
Adds an edge to the adjacency list of the node.
|
int |
Edge.compareNodes(Edge other)
Compares the node orientation of the edge with another edge.
|
void |
Node.remove(Edge e)
Removes an edge from the adjacency list of the node.
|
Modifier and Type | Class and Description |
---|---|
class |
BasicDirectedEdge
Basic implementation of DirectedEdge.
|
class |
BasicEdge
Basic implementation of Edge.
|
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) |
Edge |
BasicDirectedNode.getInEdge(DirectedNode other) |
Edge |
BasicDirectedNode.getOutEdge(DirectedNode other) |
Modifier and Type | Method and Description |
---|---|
Collection<Edge> |
BasicGraph.getEdges() |
List<Edge> |
BasicNode.getEdges() |
List<Edge> |
BasicNode.getEdges(Node other) |
Iterator<Edge> |
BasicDirectedEdge.getRelated()
Returns an iterator over all edges incident to both the in and out nodes.
|
Iterator<Edge> |
BasicEdge.getRelated()
Returns all edges that are adjacent to both the A and B nodes.
|
List<Edge> |
BasicGraph.getVisitedEdges(boolean visited) |
List<Edge> |
BasicGraph.queryEdges(GraphVisitor visitor) |
Modifier and Type | Method and Description |
---|---|
void |
BasicDirectedNode.add(Edge e)
Unsupported operation.
|
void |
BasicNode.add(Edge e)
Adds an edge to the adjacency list of the node which is an underlying List implementation.
|
int |
BasicDirectedEdge.compareNodes(Edge other) |
int |
BasicEdge.compareNodes(Edge other) |
void |
BasicDirectedNode.remove(Edge e)
Removes the edge from both the in and out adjacency lists.
|
void |
BasicNode.remove(Edge e) |
Modifier and Type | Method and Description |
---|---|
void |
BasicGraph.setEdges(Collection<Edge> edges)
Sets the edge collection for the graph.
|
Constructor and Description |
---|
BasicDirectedGraph(Collection<Node> nodes,
Collection<Edge> edges)
Creates a directed graph from a collection of directed nodes and a collection of directed
edges.
|
BasicGraph(Collection<Node> nodes,
Collection<Edge> edges)
Constructs a graph from a collection of nodes and a collection of edges.
|
Modifier and Type | Class and Description |
---|---|
class |
OptDirectedEdge
Optimized implementation of DirectedEdge.
|
class |
OptEdge
Optimized implementation of Edge.
|
Modifier and Type | Method and Description |
---|---|
Edge |
OptDirectedNode.getEdge(Node other) |
Edge |
OptNode.getEdge(Node other) |
Edge[] |
OptNode.getEdgeArray()
Returns the edge adjacency list of the node as an array.
|
Edge |
OptDirectedNode.getInEdge(DirectedNode other) |
Edge |
OptDirectedNode.getOutEdge(DirectedNode other) |
Edge |
OptEdge.RelatedIterator.next() |
Modifier and Type | Method and Description |
---|---|
List<Edge> |
OptNode.getEdges() |
List<Edge> |
OptDirectedNode.getEdges(Node other) |
List<Edge> |
OptNode.getEdges(Node other) |
List<Edge> |
OptDirectedNode.getInEdges(DirectedNode other) |
List<Edge> |
OptDirectedNode.getOutEdges(DirectedNode other) |
Iterator<Edge> |
OptEdge.getRelated() |
Modifier and Type | Method and Description |
---|---|
void |
OptDirectedNode.add(Edge e)
Not supported.
|
void |
OptNode.add(Edge e) |
int |
OptEdge.compareNodes(Edge other) |
int |
OptDirectedEdge.compareNodes(Edge other) |
void |
OptDirectedNode.remove(Edge e)
Unsupported Operation.
|
void |
OptNode.remove(Edge e)
Not supported.
|
Modifier and Type | Method and Description |
---|---|
double |
DijkstraIterator.EdgeWeighter.getWeight(Edge e)
Returns the weight for the associated edge.
|
double |
DijkstraIterator.NodeWeighter.getWeight(Node n,
Edge e1,
Edge e2)
Returns the weight for a node, with respect to two adjecent edges.
|
Modifier and Type | Class and Description |
---|---|
class |
DelaunayEdge |
Modifier and Type | Method and Description |
---|---|
Edge |
Triangle.getBoundaryEdge(XYNode n) |
Edge[] |
Triangle.getEdges() |
Edge |
Triangle.getOppositeEdge(Node n) |
Edge |
Triangle.getSharedEdge(Triangle t) |
Modifier and Type | Method and Description |
---|---|
static List<Edge> |
AutoClustUtils.findAdjacentEdges(Node node,
Collection<Edge> edges) |
List<Edge> |
AutoClustData.getLongEdges() |
List<Edge> |
AutoClustData.getOtherEdges() |
List<Edge> |
AutoClustData.getShortEdges() |
Modifier and Type | Method and Description |
---|---|
boolean |
Triangle.containsEdge(Edge e) |
Node |
Triangle.getThirdNode(Edge e) |
Modifier and Type | Method and Description |
---|---|
static List<Edge> |
AutoClustUtils.findAdjacentEdges(Node node,
Collection<Edge> edges) |
static List<Graph> |
AutoClustUtils.findConnectedComponents(Collection<Node> nodes,
Collection<Edge> edges) |
void |
AutoClustData.setLongEdges(List<Edge> l) |
void |
AutoClustData.setOtherEdges(List<Edge> l) |
void |
AutoClustData.setShortEdges(List<Edge> l) |
Constructor and Description |
---|
Triangle(Edge e1,
Edge e2,
Edge e3)
Creates a new instance of Triangle
|
Modifier and Type | Method and Description |
---|---|
void |
GraphFuser.EdgeMerger.setMergedObject(Edge newEdge,
Object merged,
List<?> edges)
Sets the object for the edge created to represented the merged object.
|
Modifier and Type | Method and Description |
---|---|
Object |
GraphFuser.EdgeMerger.merge(List<Edge> edges)
Creates a single object from collection of underlying objects represented by a collection
of edges.
|
Copyright © 1996–2022 Geotools. All rights reserved.