| Modifier and Type | Class and Description |
|---|---|
class |
LineMatchGraph<T> |
| Modifier and Type | Class and Description |
|---|---|
class |
RecordGraph |
| Modifier and Type | Method and Description |
|---|---|
Graph<T> |
Node.getGraph() |
Graph<T> |
Edge.getGraph() |
static <V> Graph<V> |
Graph.getGraph(int id) |
| Modifier and Type | Method and Description |
|---|---|
void |
Graph.moveToMidpoint(Map<Point,Point> movedNodes,
Graph<T> graph1,
Node<T> node1,
Node<T> node2) |
| Constructor and Description |
|---|
Edge(int id,
Graph<T> graph,
Node<T> fromNode,
Node<T> toNode) |
EdgeLineList(Graph<?> graph) |
EdgeLineList(Graph<?> graph,
List<Integer> edgeIds) |
EdgeList(Graph<T> graph) |
EdgeList(Graph<T> graph,
List<Integer> edgeIds) |
EdgeQuadTree(Graph<T> graph) |
Node(int nodeId,
Graph<T> graph,
Point point) |
NodeList(Graph<T> graph,
List<Integer> nodeIds) |
NodeQuadTree(Graph<T> graph) |
| Modifier and Type | Class and Description |
|---|---|
class |
GeometryGraph |
| Modifier and Type | Class and Description |
|---|---|
class |
LineStringGraph |
| Modifier and Type | Method and Description |
|---|---|
Graph<LineSegment> |
LineStringRelate.getGraph1() |
Graph<LineSegment> |
LineStringRelate.getGraph2() |
| Modifier and Type | Method and Description |
|---|---|
static List<Edge<LineSegment>> |
EdgeLessThanDistance.getEdges(Graph<LineSegment> graph,
LineSegment lineSegment,
double maxDistance) |
Map<Edge<LineSegment>,List<Node<LineSegment>>> |
LineStringGraph.getPointsOnEdges(Graph<LineSegment> graph1,
double tolerance) |
| Modifier and Type | Method and Description |
|---|---|
static <T> List<Edge<T>> |
EdgeWithinDistance.edgesWithinDistance(Graph<T> graph,
Geometry geometry,
double maxDistance) |
static <T> List<Edge<T>> |
EdgeWithinDistance.edgesWithinDistance(Graph<T> graph,
Node<T> node,
double maxDistance) |
static <T> List<Edge<T>> |
EdgeLessThanDistanceToNodeVisitor.edgesWithinDistance(Graph<T> graph,
Node<T> node,
double maxDistance) |
static <T> List<Edge<T>> |
EdgeWithinDistance.edgesWithinDistance(Graph<T> graph,
Point point,
double maxDistance) |
static <T> List<Edge<T>> |
EdgeIntersectsLinearlyEdgeVisitor.getEdges(Graph<T> graph,
Edge<T> edge) |
static <T> List<Edge<T>> |
BoundingBoxIntersectsEdgeVisitor.getEdges(Graph<T> graph,
Edge<T> edge,
double maxDistance) |
static <T> List<Edge<T>> |
EdgeIntersectLineVisitor.getEdges(Graph<T> graph,
LineString line) |
static <T> List<Edge<T>> |
NodeOnEdgeVisitor.getEdges(Graph<T> graph,
Node<T> node,
double maxDistance) |
static <T> List<Node<T>> |
NodeWithinBoundingBoxVisitor.getNodes(Graph<T> graph,
BoundingBox boundingBox) |
static <T> List<Node<T>> |
NodeWithinDistanceOfGeometryVisitor.getNodes(Graph<T> graph,
Geometry geometry,
double maxDistance) |
static <T> List<Node<T>> |
NodeLessThanDistanceOfGeometryVisitor.getNodes(Graph<T> graph,
Geometry geometry,
double maxDistance) |
static <T> List<Node<T>> |
OnLineNodeVisitor.getNodes(Graph<T> graph,
LineString line,
double maxDistance) |
static <T> List<Node<T>> |
NodeLessThanDistanceOfCoordinatesVisitor.getNodes(Graph<T> graph,
Point point,
double maxDistance) |
void |
MapPseudoNodeRemovalVisitor.process(Graph<Map<String,Object>> graph) |
void |
RemoveBothDuplicateEdgeVisitor.process(Graph<T> graph) |
void |
DeleteEdgeVisitor.process(Graph<T> graph) |
static <T> void |
ChannelOutEdgeVisitor.write(Graph<T> graph,
Channel<T> out) |
static <T> void |
ChannelOutEdgeVisitor.write(Graph<T> graph,
Filter<T> filter,
Channel<T> out) |
| Constructor and Description |
|---|
EdgeCleanCloseVerticesVisitor(Graph<T> graph,
double minDistance) |
EdgeCleanCloseVerticesVisitor(Graph<T> graph,
double minDistance,
Visitor<Edge<T>> visitor) |
SplitCrossingEdgesVisitor(Graph<T> graph) |
SplitEdgesCloseToNodeVisitor(Graph<T> graph,
double maxDistance) |
SplitEdgesCloseToNodeVisitor(Graph<T> graph,
String ruleName,
double maxDistance) |
| Modifier and Type | Method and Description |
|---|---|
static <T> boolean |
CoordinatesListUtil.movePointsWithinTolerance(Map<Point,Point> movedNodes,
Graph<T> graph2,
double maxDistance,
Node<T> node1)
Only move the node if there is one of them
|
Copyright © 2015 Revolution Systems Inc.. All rights reserved.