public class RoutingCHGraphImpl extends Object implements RoutingCHGraph
| Constructor and Description |
|---|
RoutingCHGraphImpl(CHGraph chGraph) |
| 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 edgeFrom,
int nodeVia,
int edgeTo) |
Weighting |
getWeighting() |
boolean |
hasTurnCosts() |
boolean |
isAdjacentToNode(int chEdge,
int node) |
boolean |
isEdgeBased() |
public RoutingCHGraphImpl(CHGraph chGraph)
public int getNodes()
getNodes in interface RoutingCHGraphpublic int getEdges()
getEdges in interface RoutingCHGraphpublic int getOtherNode(int chEdge,
int node)
getOtherNode in interface RoutingCHGraphpublic boolean isAdjacentToNode(int chEdge,
int node)
isAdjacentToNode in interface RoutingCHGraphpublic RoutingCHEdgeExplorer createInEdgeExplorer()
createInEdgeExplorer in interface RoutingCHGraphpublic RoutingCHEdgeExplorer createOutEdgeExplorer()
createOutEdgeExplorer in interface RoutingCHGraphpublic RoutingCHEdgeIteratorState getEdgeIteratorState(int chEdge, int adjNode)
getEdgeIteratorState in interface RoutingCHGraphpublic int getLevel(int node)
getLevel in interface RoutingCHGraphpublic Graph getBaseGraph()
getBaseGraph in interface RoutingCHGraphGraph 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
neededpublic Weighting getWeighting()
getWeighting in interface RoutingCHGraphpublic boolean hasTurnCosts()
hasTurnCosts in interface RoutingCHGraphpublic boolean isEdgeBased()
isEdgeBased in interface RoutingCHGraphpublic double getTurnWeight(int edgeFrom,
int nodeVia,
int edgeTo)
getTurnWeight in interface RoutingCHGraphCopyright © 2012–2020. All rights reserved.