com.graphhopper.storage

Class RoutingCHGraphImpl

java.lang.Object

com.graphhopper.storage.RoutingCHGraphImpl

All Implemented Interfaces:

RoutingCHGraph

public class RoutingCHGraphImpl
extends Object
implements RoutingCHGraph

Constructor Summary

Constructors

Constructor and Description
RoutingCHGraphImpl(BaseGraph baseGraph, CHStorage chStorage, Weighting weighting)

Method Summary

Modifier and Type	Method and Description
void	close()
RoutingCHEdgeExplorer	createInEdgeExplorer() Traverses the base edges and shortcuts at a given node.
RoutingCHEdgeExplorer	createOutEdgeExplorer()
static RoutingCHGraph	fromGraph(BaseGraph baseGraph, CHStorage chStorage, CHConfig chConfig)
Graph	getBaseGraph()
RoutingCHEdgeIteratorState	getEdgeIteratorState(int chEdge, int adjNode)
int	getEdges()
int	getLevel(int node)
int	getNodes()
int	getShortcuts()
double	getTurnWeight(int edgeFrom, int nodeVia, int edgeTo)
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 Detail

RoutingCHGraphImpl

public RoutingCHGraphImpl(BaseGraph baseGraph,
                          CHStorage chStorage,
                          Weighting weighting)

Method Detail

fromGraph

public static RoutingCHGraph fromGraph(BaseGraph baseGraph,
                                       CHStorage chStorage,
                                       CHConfig chConfig)

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

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

getWeighting

public Weighting getWeighting()

Specified by:

getWeighting in interface RoutingCHGraph

hasTurnCosts

public boolean hasTurnCosts()

Specified by:

hasTurnCosts in interface RoutingCHGraph

isEdgeBased

public boolean isEdgeBased()

Specified by:

isEdgeBased in interface RoutingCHGraph

getTurnWeight

public double getTurnWeight(int edgeFrom,
                            int nodeVia,
                            int edgeTo)

Specified by:

getTurnWeight in interface RoutingCHGraph

close

public void close()

Specified by:

close in interface RoutingCHGraph