Package com.graphhopper.storage

Interface RoutingCHGraph

All Known Implementing Classes:

QueryRoutingCHGraph, RoutingCHGraphImpl

public interface RoutingCHGraph

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()

Method Details

getNodes

int getNodes()

getEdges

int getEdges()

getShortcuts

int getShortcuts()

createInEdgeExplorer

RoutingCHEdgeExplorer createInEdgeExplorer()

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.

createOutEdgeExplorer

RoutingCHEdgeExplorer createOutEdgeExplorer()

See Also:

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

getEdgeIteratorState

RoutingCHEdgeIteratorState getEdgeIteratorState(int chEdge,
 int adjNode)

getLevel

int getLevel(int node)

getTurnWeight

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

getBaseGraph

Graph getBaseGraph()

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

boolean hasTurnCosts()

isEdgeBased

boolean isEdgeBased()

getWeighting

Weighting getWeighting()

close

void close()