public interface CHGraph extends Graph
Modifier and Type | Method and Description |
---|---|
CHEdgeExplorer |
createEdgeExplorer() |
CHEdgeExplorer |
createEdgeExplorer(EdgeFilter filter)
Returns an EdgeExplorer which makes it possible to traverse all filtered edges of a specific
node.
|
EdgeExplorer |
createOriginalEdgeExplorer() |
EdgeExplorer |
createOriginalEdgeExplorer(EdgeFilter filter) |
void |
disconnectEdge(int edge,
int adjNode,
int prevEdge) |
AllCHEdgesIterator |
getAllEdges() |
CHConfig |
getCHConfig()
Returns the profile of this CH graph.
|
CHEdgeIteratorState |
getEdgeIteratorState(int edgeId,
int endNode)
Returns a wrapper over the specified edgeId.
|
int |
getLevel(int nodeId) |
NodeOrderingProvider |
getNodeOrderingProvider() |
int |
getOriginalEdges() |
boolean |
isReadyForContraction() |
boolean |
isShortcut(int edgeId) |
void |
setLevel(int nodeId,
int level)
This methods sets the level of the specified node.
|
int |
shortcut(int a,
int b,
int accessFlags,
double weight,
int skippedEdge1,
int skippedEdge2)
This method creates a shortcut between a to b which is nearly identical to creating an edge
except that it can be excluded or included for certain traversals or algorithms.
|
int |
shortcutEdgeBased(int a,
int b,
int accessFlags,
double weight,
int skippedEdge1,
int skippedEdge2,
int origFirst,
int origLast)
like shortcut(), but for edge-based CH
|
copyTo, edge, edge, getBaseGraph, getBounds, getEdges, getNodeAccess, getNodes, getOtherNode, getTurnCostStorage, isAdjacentToNode, wrapWeighting
void setLevel(int nodeId, int level)
int getLevel(int nodeId)
CHConfig getCHConfig()
boolean isShortcut(int edgeId)
int shortcut(int a, int b, int accessFlags, double weight, int skippedEdge1, int skippedEdge2)
int shortcutEdgeBased(int a, int b, int accessFlags, double weight, int skippedEdge1, int skippedEdge2, int origFirst, int origLast)
origFirst
- The first original edge that is skipped by this shortcut. For example for the following shortcut
edge from x to y, which itself skips the shortcuts x->v and v->y the first original edge would
be x->u: x->u->v->w->yorigLast
- like origFirst, but the last orig edge, i.e w->y in above exampleCHEdgeIteratorState getEdgeIteratorState(int edgeId, int endNode)
Graph
getEdgeIteratorState
in interface Graph
endNode
- is the node that will be returned via getAdjNode(). If adjNode is
Integer.MIN_VALUE then the edge will be returned in the direction of how it is storedCHEdgeExplorer createEdgeExplorer()
createEdgeExplorer
in interface Graph
Graph.createEdgeExplorer(com.graphhopper.routing.util.EdgeFilter)
CHEdgeExplorer createEdgeExplorer(EdgeFilter filter)
Graph
createEdgeExplorer
in interface Graph
EdgeExplorer
,
Graph.createEdgeExplorer()
EdgeExplorer createOriginalEdgeExplorer()
EdgeExplorer createOriginalEdgeExplorer(EdgeFilter filter)
AllCHEdgesIterator getAllEdges()
getAllEdges
in interface Graph
void disconnectEdge(int edge, int adjNode, int prevEdge)
int getOriginalEdges()
NodeOrderingProvider getNodeOrderingProvider()
boolean isReadyForContraction()
Copyright © 2012–2020. All rights reserved.