com.revolsys.gis.graph

Class Graph<T>

java.lang.Object

com.revolsys.gis.graph.Graph<T>

Direct Known Subclasses:

GeometryGraph, LineMatchGraph, LineStringGraph, RecordGraph

public class Graph<T>
extends Object

Constructor Summary

Constructors

Modifier	Constructor and Description
	Graph()
protected	Graph(boolean storeLines)

Method Summary

Methods

Modifier and Type	Method and Description
void	add(NodeEventListener<T> listener)
Edge<T>	addEdge(T object, LineString line)
protected Edge<T>	addEdge(T object, LineString line, Point from, Point to) Actually add the edge.
protected Edge<T>	addEdge(T object, Point from, Point to)
void	addEdgeListener(EdgeEventListener<T> listener)
protected T	clone(T object, LineString line) Clone the object, setting the line property to the new value.
void	close()
boolean	contains(Edge<T> edge)
Edge<T>	createEdge(GeometryFactory geometryFactory, T object, LineString points)
void	deleteEdges(Filter<Edge<T>> filter)
protected void	evict(Edge<T> edge)
protected void	evict(Node<T> node)
List<Edge<T>>	findEdges(EdgeVisitor<T> visitor)
List<Edge<T>>	findEdges(Point point, double distance)
Node<T>	findNode(Point point) Find the node by point coordinates returning the node if it exists, null otherwise.
List<Node<T>>	findNodes(BoundingBox boundingBox)
List<Node<T>>	findNodes(Edge<T> edge, double distance) Find all the nodes <= the distance of the edge, that are "on" the line.
List<Node<T>>	findNodes(Geometry geometry, double distance) Find the nodes <= the distance of the specified geometry.
List<Node<T>>	findNodes(Node<T> node, double distance) Find all the nodes <= the distance of the node.
List<Node<T>>	findNodes(Point point, double distance) Find the nodes <= the distance of the specified point coordinates.
List<Node<T>>	findNodesOfDegree(int degree)
double	getClosestDistance(Node<T> node, double maxDistance)
Edge<T>	getEdge(int edgeId)
protected <V> V	getEdgeAttribute(int edgeId, String name)
protected Map<String,Object>	getEdgeAttributes(int edgeId)
int	getEdgeCount()
Collection<Integer>	getEdgeIds()
int[]	getEdgeIds(Collection<Edge<T>> edges)
IdObjectIndex<Edge<T>>	getEdgeIndex()
LineString	getEdgeLine(int edgeId)
List<LineString>	getEdgeLines()
T	getEdgeObject(int edgeId)
List<Edge<T>>	getEdges()
List<Edge<T>>	getEdges(Comparator<Edge<T>> comparator)
List<Edge<T>>	getEdges(Edge<T> edge)
List<Edge<T>>	getEdges(Filter<Edge<T>> filter)
List<Edge<T>>	getEdges(Filter<Edge<T>> filter, BoundingBox envelope)
List<Edge<T>>	getEdges(Filter<Edge<T>> filter, Comparator<Edge<T>> comparator)
List<Edge<T>>	getEdges(Filter<Edge<T>> filter, Comparator<Edge<T>> comparator, BoundingBox envelope)
List<Edge<T>>	getEdges(Filter<Edge<T>> filter, Comparator<Edge<T>> comparator, Geometry geometry)
List<Edge<T>>	getEdges(Filter<Edge<T>> filter, Geometry geometry)
List<Edge<T>>	getEdges(int... ids)
List<Edge<T>>	getEdges(List<Integer> ids)
GeometryFactory	getGeometryFactory()
static <V> Graph<V>	getGraph(int id)
int	getId()
int	getMaxEdgesInMemory()
Node<T>	getNode(int nodeId)
Node<T>	getNode(Point point) Get the node by point coordinates, creating one if it did not exist.
protected <V> V	getNodeAttribute(int nodeId, String name)
protected Map<String,Object>	getNodeAttributes(int nodeId)
Collection<Integer>	getNodeIds()
IdObjectIndex<Node<T>>	getNodeIndex()
List<Node<T>>	getNodes()
List<Node<T>>	getNodes(Comparator<Node<T>> comparator)
List<Node<T>>	getNodes(Filter<Node<T>> filter)
List<Node<T>>	getNodes(Filter<Node<T>> filter, BoundingBox envelope)
List<Node<T>>	getNodes(Filter<Node<T>> filter, Comparator<Node<T>> comparator)
List<Node<T>>	getNodes(Filter<Node<T>> filter, Comparator<Node<T>> comparator, BoundingBox envelope)
List<Node<T>>	getNodes(List<Integer> nodeIds)
List<T>	getObjects()
GeometryFactory	getPrecisionModel()
String	getTypeName(Edge<T> edge) Get the type name for the edge.
boolean	hasEdge(Edge<T> edge)
boolean	hasEdgeBetween(Point fromPoint, Point toPoint)
Edge<T>	merge(Node<T> node, Edge<T> edge1, Edge<T> edge2) Merge the two edges at the node.
Edge<T>	mergeEdges(Edge<T> edge1, Edge<T> edge2) Merge the two edges into a single edge, removing the old edges and node if required from the graph and adding a new edge to the graph.
void	moveNode(String typePath, Node<Record> fromNode, Node<Record> toNode, Point newPoint)
boolean	moveNodesToMidpoint(String typePath, Node<Record> node1, Node<Record> node2)
boolean	movePointsWithinTolerance(Map<Point,Point> movedNodes, double maxDistance, Node<T> node1)
void	moveToMidpoint(Map<Point,Point> movedNodes, Graph<T> graph1, Node<T> node1, Node<T> node2)
void	nodeMoved(Node<T> node, Node<T> newNode)
Iterable<Node<T>>	nodes()
void	queryEdges(EdgeVisitor<T> visitor)
void	queryEdges(EdgeVisitor<T> visitor, Visitor<Edge<T>> matchVisitor)
void	remove(Edge<T> edge)
void	remove(EdgeEventListener<T> listener)
void	remove(Node<T> node)
void	remove(NodeEventListener<T> listener)
List<Edge<T>>	replaceEdge(Edge<T> edge, Geometry lines)
Edge<T>	replaceEdge(Edge<T> edge, LineString line)
List<Edge<T>>	replaceEdge(Edge<T> edge, List<LineString> lines)
protected void	setEdgeAttribute(int edgeId, String name, Object value)
protected void	setEdgeAttributes(int edgeId, Map<String,Object> attributes)
void	setGeometryFactory(GeometryFactory geometryFactory)
void	setMaxEdgesInMemory(int maxEdgesInMemory)
protected void	setNodeAttribute(int edgeId, String name, Object value)
protected void	setNodeAttributes(int edgeId, Map<String,Object> attributes)
void	setPrecisionModel(GeometryFactory precisionModel)
<V extends Point> List<Edge<T>>	splitEdge(Edge<T> edge, Collection<V> nodes)
<V extends Point> List<Edge<T>>	splitEdge(Edge<T> edge, Collection<V> splitPoints, double maxDistance)
List<Edge<T>>	splitEdge(Edge<T> edge, Node<T> node)
List<Edge<T>>	splitEdge(Edge<T> edge, Point... nodes)
void	visitEdges(Comparator<Edge<T>> comparator, Visitor<Edge<T>> visitor)
void	visitEdges(Filter<Edge<T>> filter, Comparator<Edge<T>> comparator, Visitor<Edge<T>> visitor)
void	visitEdges(Filter<Edge<T>> filter, Visitor<Edge<T>> visitor)
void	visitEdges(Visitor<Edge<T>> visitor)
void	visitEdges(Visitor<Edge<T>> visitor, BoundingBox envelope)
void	visitNodes(Filter<Node<T>> filter, Comparator<Node<T>> comparator, Visitor<Node<T>> visitor)
void	visitNodes(Filter<Node<T>> filter, Visitor<Node<T>> visitor)
void	visitNodes(Visitor<Node<T>> visitor)
void	visitNodes(Visitor<Node<T>> visitor, Comparator<Node<T>> comparator)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Graph

public Graph()

Graph

protected Graph(boolean storeLines)

Method Detail

getGraph

public static <V> Graph<V> getGraph(int id)

add

public void add(NodeEventListener<T> listener)

addEdge

public Edge<T> addEdge(T object,
              LineString line)

addEdge

protected Edge<T> addEdge(T object,
              LineString line,
              Point from,
              Point to)

Actually add the edge.

Parameters:

object -

line -

from -

to -

Returns:

addEdge

protected Edge<T> addEdge(T object,
              Point from,
              Point to)

addEdgeListener

public void addEdgeListener(EdgeEventListener<T> listener)

clone

protected T clone(T object,
      LineString line)

Clone the object, setting the line property to the new value.

Parameters:

object - The object to clone.

line - The line.

Returns:

The new object.

close

@PreDestroy
public void close()

contains

public boolean contains(Edge<T> edge)

createEdge

public Edge<T> createEdge(GeometryFactory geometryFactory,
                 T object,
                 LineString points)

deleteEdges

public void deleteEdges(Filter<Edge<T>> filter)

evict

protected void evict(Edge<T> edge)

evict

protected void evict(Node<T> node)

findEdges

public List<Edge<T>> findEdges(EdgeVisitor<T> visitor)

findEdges

public List<Edge<T>> findEdges(Point point,
                      double distance)

findNode

public Node<T> findNode(Point point)

Find the node by point coordinates returning the node if it exists, null otherwise.

Parameters:

point - The point coordinates to find the node for.

Returns:

The nod or null if not found.

findNodes

public List<Node<T>> findNodes(BoundingBox boundingBox)

findNodes

public List<Node<T>> findNodes(Edge<T> edge,
                      double distance)

Find all the nodes <= the distance of the edge, that are "on" the line.

Parameters:

edge - The edge.

distance - The distance.

Returns:

The nodes

See Also:

IsPointOnLineEdgeFilter

findNodes

public List<Node<T>> findNodes(Geometry geometry,
                      double distance)

Find the nodes <= the distance of the specified geometry.

Parameters:

geometry - The geometry.

distance - The distance.

Returns:

The list of nodes.

findNodes

public List<Node<T>> findNodes(Node<T> node,
                      double distance)

Find all the nodes <= the distance of the node.

Parameters:

node - The node.

distance - The distance.

Returns:

The nodes.

findNodes

public List<Node<T>> findNodes(Point point,
                      double distance)

Find the nodes <= the distance of the specified point coordinates.

Parameters:

point - The point coordinates.

distance - The distance.

Returns:

The list of nodes.

findNodesOfDegree

public List<Node<T>> findNodesOfDegree(int degree)

getClosestDistance

public double getClosestDistance(Node<T> node,
                        double maxDistance)

getEdge

public Edge<T> getEdge(int edgeId)

getEdgeAttribute

protected <V> V getEdgeAttribute(int edgeId,
                     String name)

getEdgeAttributes

protected Map<String,Object> getEdgeAttributes(int edgeId)

getEdgeCount

public int getEdgeCount()

getEdgeIds

public Collection<Integer> getEdgeIds()

getEdgeIds

public int[] getEdgeIds(Collection<Edge<T>> edges)

getEdgeIndex

public IdObjectIndex<Edge<T>> getEdgeIndex()

getEdgeLine

public LineString getEdgeLine(int edgeId)

getEdgeLines

public List<LineString> getEdgeLines()

getEdgeObject

public T getEdgeObject(int edgeId)

getEdges

public List<Edge<T>> getEdges()

getEdges

public List<Edge<T>> getEdges(Comparator<Edge<T>> comparator)

getEdges

public List<Edge<T>> getEdges(Edge<T> edge)

getEdges

public List<Edge<T>> getEdges(Filter<Edge<T>> filter)

getEdges

public List<Edge<T>> getEdges(Filter<Edge<T>> filter,
                     BoundingBox envelope)

getEdges

public List<Edge<T>> getEdges(Filter<Edge<T>> filter,
                     Comparator<Edge<T>> comparator)

getEdges

public List<Edge<T>> getEdges(Filter<Edge<T>> filter,
                     Comparator<Edge<T>> comparator,
                     BoundingBox envelope)

getEdges

public List<Edge<T>> getEdges(Filter<Edge<T>> filter,
                     Comparator<Edge<T>> comparator,
                     Geometry geometry)

getEdges

public List<Edge<T>> getEdges(Filter<Edge<T>> filter,
                     Geometry geometry)

getEdges

public List<Edge<T>> getEdges(int... ids)

getEdges

public List<Edge<T>> getEdges(List<Integer> ids)

getGeometryFactory

public GeometryFactory getGeometryFactory()

getId

public int getId()

getMaxEdgesInMemory

public int getMaxEdgesInMemory()

getNode

public Node<T> getNode(int nodeId)

getNode

public Node<T> getNode(Point point)

Get the node by point coordinates, creating one if it did not exist.

Parameters:

point - The point coordinates to get the node for.

Returns:

The node.

getNodeAttribute

protected <V> V getNodeAttribute(int nodeId,
                     String name)

getNodeAttributes

protected Map<String,Object> getNodeAttributes(int nodeId)

getNodeIds

public Collection<Integer> getNodeIds()

getNodeIndex

public IdObjectIndex<Node<T>> getNodeIndex()

getNodes

public List<Node<T>> getNodes()

getNodes

public List<Node<T>> getNodes(Comparator<Node<T>> comparator)

getNodes

public List<Node<T>> getNodes(Filter<Node<T>> filter)

getNodes

public List<Node<T>> getNodes(Filter<Node<T>> filter,
                     BoundingBox envelope)

getNodes

public List<Node<T>> getNodes(Filter<Node<T>> filter,
                     Comparator<Node<T>> comparator)

getNodes

public List<Node<T>> getNodes(Filter<Node<T>> filter,
                     Comparator<Node<T>> comparator,
                     BoundingBox envelope)

getNodes

public List<Node<T>> getNodes(List<Integer> nodeIds)

getObjects

public List<T> getObjects()

getPrecisionModel

public GeometryFactory getPrecisionModel()

getTypeName

public String getTypeName(Edge<T> edge)

Get the type name for the edge.

Parameters:

edge - The edge.

Returns:

The type name.

hasEdge

public boolean hasEdge(Edge<T> edge)

hasEdgeBetween

public boolean hasEdgeBetween(Point fromPoint,
                     Point toPoint)

merge

public Edge<T> merge(Node<T> node,
            Edge<T> edge1,
            Edge<T> edge2)

Merge the two edges at the node.

Parameters:

node -

edge1 -

edge2 -

mergeEdges

public Edge<T> mergeEdges(Edge<T> edge1,
                 Edge<T> edge2)

Merge the two edges into a single edge, removing the old edges and node if required from the graph and adding a new edge to the graph.

Parameters:

reversedEdges - The list of edges that need to be reversed.

node - The node to remove.

edge1 - The first edge to merge.

edge2 - The second edge to merge.

Returns:

The new edge.

moveNode

public void moveNode(String typePath,
            Node<Record> fromNode,
            Node<Record> toNode,
            Point newPoint)

moveNodesToMidpoint

public boolean moveNodesToMidpoint(String typePath,
                          Node<Record> node1,
                          Node<Record> node2)

movePointsWithinTolerance

public boolean movePointsWithinTolerance(Map<Point,Point> movedNodes,
                                double maxDistance,
                                Node<T> node1)

moveToMidpoint

public void moveToMidpoint(Map<Point,Point> movedNodes,
                  Graph<T> graph1,
                  Node<T> node1,
                  Node<T> node2)

nodeMoved

public void nodeMoved(Node<T> node,
             Node<T> newNode)

nodes

public Iterable<Node<T>> nodes()

queryEdges

public void queryEdges(EdgeVisitor<T> visitor)

queryEdges

public void queryEdges(EdgeVisitor<T> visitor,
              Visitor<Edge<T>> matchVisitor)

remove

public void remove(Edge<T> edge)

remove

public void remove(EdgeEventListener<T> listener)

remove

public void remove(Node<T> node)

remove

public void remove(NodeEventListener<T> listener)

replaceEdge

public List<Edge<T>> replaceEdge(Edge<T> edge,
                        Geometry lines)

replaceEdge

public Edge<T> replaceEdge(Edge<T> edge,
                  LineString line)

replaceEdge

public List<Edge<T>> replaceEdge(Edge<T> edge,
                        List<LineString> lines)

setEdgeAttribute

protected void setEdgeAttribute(int edgeId,
                    String name,
                    Object value)

setEdgeAttributes

protected void setEdgeAttributes(int edgeId,
                     Map<String,Object> attributes)

setGeometryFactory

public void setGeometryFactory(GeometryFactory geometryFactory)

setMaxEdgesInMemory

public void setMaxEdgesInMemory(int maxEdgesInMemory)

setNodeAttribute

protected void setNodeAttribute(int edgeId,
                    String name,
                    Object value)

setNodeAttributes

protected void setNodeAttributes(int edgeId,
                     Map<String,Object> attributes)

setPrecisionModel

public void setPrecisionModel(GeometryFactory precisionModel)

splitEdge

public <V extends Point> List<Edge<T>> splitEdge(Edge<T> edge,
                                        Collection<V> nodes)

splitEdge

public <V extends Point> List<Edge<T>> splitEdge(Edge<T> edge,
                                        Collection<V> splitPoints,
                                        double maxDistance)

splitEdge

public List<Edge<T>> splitEdge(Edge<T> edge,
                      Node<T> node)

splitEdge

public List<Edge<T>> splitEdge(Edge<T> edge,
                      Point... nodes)

visitEdges

public void visitEdges(Comparator<Edge<T>> comparator,
              Visitor<Edge<T>> visitor)

visitEdges

public void visitEdges(Filter<Edge<T>> filter,
              Comparator<Edge<T>> comparator,
              Visitor<Edge<T>> visitor)

visitEdges

public void visitEdges(Filter<Edge<T>> filter,
              Visitor<Edge<T>> visitor)

visitEdges

public void visitEdges(Visitor<Edge<T>> visitor)

visitEdges

public void visitEdges(Visitor<Edge<T>> visitor,
              BoundingBox envelope)

visitNodes

public void visitNodes(Filter<Node<T>> filter,
              Comparator<Node<T>> comparator,
              Visitor<Node<T>> visitor)

visitNodes

public void visitNodes(Filter<Node<T>> filter,
              Visitor<Node<T>> visitor)

visitNodes

public void visitNodes(Visitor<Node<T>> visitor)

visitNodes

public void visitNodes(Visitor<Node<T>> visitor,
              Comparator<Node<T>> comparator)