Package com.graphhopper.routing.querygraph

Class QueryRoutingCHGraph

java.lang.Object

com.graphhopper.routing.querygraph.QueryRoutingCHGraph

All Implemented Interfaces:

RoutingCHGraph

public class QueryRoutingCHGraph
extends Object
implements RoutingCHGraph

This class is used to allow routing between virtual nodes (snapped coordinates that lie between the nodes of the original graph) when using CH. To use it first create a QueryGraph just as if you were not using CH and then create an instance of the present class on top of this.

Constructor Summary

Constructors

Constructor	Description
QueryRoutingCHGraph(RoutingCHGraph routingCHGraph, QueryGraph queryGraph)

Method Summary

Modifier and Type	Method	Description
void	close()
RoutingCHEdgeExplorer	createInEdgeExplorer()	Traverses the base edges and shortcuts at a given node.
RoutingCHEdgeExplorer	createOutEdgeExplorer()
Graph	getBaseGraph()
RoutingCHEdgeIteratorState	getEdgeIteratorState(int chEdge, int adjNode)
int	getEdges()
int	getLevel(int node)
int	getNodes()
int	getShortcuts()
double	getTurnWeight(int inEdge, int viaNode, int outEdge)
Weighting	getWeighting()
boolean	hasTurnCosts()
boolean	isEdgeBased()

Methods inherited from class java.lang.Object

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

Constructor Details

QueryRoutingCHGraph

public QueryRoutingCHGraph(RoutingCHGraph routingCHGraph,
 QueryGraph queryGraph)

Method Details

getNodes

public int getNodes()

Specified by:

getNodes in interface RoutingCHGraph

getEdges

public int getEdges()

Specified by:

getEdges in interface RoutingCHGraph

getShortcuts

public int getShortcuts()

Specified by:

getShortcuts in interface RoutingCHGraph

createInEdgeExplorer

public RoutingCHEdgeExplorer createInEdgeExplorer()

Description copied from interface: RoutingCHGraph

Traverses the base edges and shortcuts at a given node. This will only include shortcuts coming from higher level nodes, but *all* base edges with finite weight.

Specified by:

createInEdgeExplorer in interface RoutingCHGraph

createOutEdgeExplorer

public RoutingCHEdgeExplorer createOutEdgeExplorer()

Specified by:

createOutEdgeExplorer in interface RoutingCHGraph

See Also:

• but here the shortcuts/edges are going out of the given node.

getEdgeIteratorState

public RoutingCHEdgeIteratorState getEdgeIteratorState(int chEdge,
 int adjNode)

Specified by:

getEdgeIteratorState in interface RoutingCHGraph

getLevel

public int getLevel(int node)

Specified by:

getLevel in interface RoutingCHGraph

getTurnWeight

public double getTurnWeight(int inEdge,
 int viaNode,
 int outEdge)

Specified by:

getTurnWeight in interface RoutingCHGraph

getBaseGraph

public Graph getBaseGraph()

Specified by:

getBaseGraph in interface RoutingCHGraph

Returns:

the graph this CH graph is based on, i.e. a the base 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 needed

hasTurnCosts

public boolean hasTurnCosts()

Specified by:

hasTurnCosts in interface RoutingCHGraph

isEdgeBased

public boolean isEdgeBased()

Specified by:

isEdgeBased in interface RoutingCHGraph

getWeighting

public Weighting getWeighting()

Specified by:

getWeighting in interface RoutingCHGraph

close

public void close()

Specified by:

close in interface RoutingCHGraph