public interface RoutingCHGraph
| Modifier and Type | Method and Description |
|---|---|
RoutingCHEdgeExplorer |
createInEdgeExplorer() |
RoutingCHEdgeExplorer |
createOutEdgeExplorer() |
Graph |
getBaseGraph() |
RoutingCHEdgeIteratorState |
getEdgeIteratorState(int chEdge,
int adjNode) |
int |
getEdges() |
int |
getLevel(int node) |
int |
getNodes() |
int |
getOtherNode(int chEdge,
int node) |
double |
getTurnWeight(int inEdge,
int viaNode,
int outEdge) |
Weighting |
getWeighting() |
boolean |
hasTurnCosts() |
boolean |
isAdjacentToNode(int chEdge,
int node) |
boolean |
isEdgeBased() |
int getNodes()
int getEdges()
int getOtherNode(int chEdge,
int node)
boolean isAdjacentToNode(int chEdge,
int node)
RoutingCHEdgeExplorer createInEdgeExplorer()
RoutingCHEdgeExplorer createOutEdgeExplorer()
RoutingCHEdgeIteratorState getEdgeIteratorState(int chEdge, int adjNode)
int getLevel(int node)
double getTurnWeight(int inEdge,
int viaNode,
int outEdge)
Graph getBaseGraph()
Graph or a QueryGraph on top of the
base graph
todo: maybe it would be better to remove this method and use a direct reference to the base graph when it is
neededboolean hasTurnCosts()
boolean isEdgeBased()
Weighting getWeighting()
Copyright © 2012–2021. All rights reserved.