com.graphhopper.routing.ch

Class CHPreparationGraph

java.lang.Object

com.graphhopper.routing.ch.CHPreparationGraph

public class CHPreparationGraph
extends Object

Graph data structure used for CH preparation. It allows caching weights, and edges that are not needed anymore (those adjacent to contracted nodes) can be removed (see disconnect(int).

Author:

easbar

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	CHPreparationGraph.PrepareBaseEdge
static interface	CHPreparationGraph.TurnCostFunction

Method Summary

Modifier and Type	Method and Description
void	addEdge(int from, int to, int edge, double weightFwd, double weightBwd)
int	addShortcut(int from, int to, int origEdgeKeyFirst, int origEdgeKeyLast, int skipped1, int skipped2, double weight, int origEdgeCount)
static void	buildFromGraph(CHPreparationGraph prepareGraph, Graph graph, Weighting weighting)
static CHPreparationGraph.TurnCostFunction	buildTurnCostFunctionFromTurnCostStorage(Graph graph, Weighting weighting) Builds a turn cost function for a given graph('s turn cost storage) and given uTurnCosts.
void	close()
PrepareGraphEdgeExplorer	createInEdgeExplorer()
PrepareGraphOrigEdgeExplorer	createInOrigEdgeExplorer()
PrepareGraphEdgeExplorer	createOutEdgeExplorer()
PrepareGraphOrigEdgeExplorer	createOutOrigEdgeExplorer()
com.carrotsearch.hppc.IntContainer	disconnect(int node)
static CHPreparationGraph	edgeBased(int nodes, int edges, CHPreparationGraph.TurnCostFunction turnCostFunction)
int	getDegree(int node)
int	getNodes()
int	getOriginalEdges()
int	getShortcutForPrepareEdge(int prepareEdge)
double	getTurnWeight(int inEdgeKey, int viaNode, int outEdgeKey)
static CHPreparationGraph	nodeBased(int nodes, int edges)
void	prepareForContraction()
void	setShortcutForPrepareEdge(int prepareEdge, int shortcut)

Methods inherited from class java.lang.Object

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

Method Detail

nodeBased

public static CHPreparationGraph nodeBased(int nodes,
                                           int edges)

edgeBased

public static CHPreparationGraph edgeBased(int nodes,
                                           int edges,
                                           CHPreparationGraph.TurnCostFunction turnCostFunction)

buildFromGraph

public static void buildFromGraph(CHPreparationGraph prepareGraph,
                                  Graph graph,
                                  Weighting weighting)

buildTurnCostFunctionFromTurnCostStorage

public static CHPreparationGraph.TurnCostFunction buildTurnCostFunctionFromTurnCostStorage(Graph graph,
                                                                                           Weighting weighting)

Builds a turn cost function for a given graph('s turn cost storage) and given uTurnCosts. The trivial implementation would be simply using Weighting.calcTurnWeight(int, int, int). However, it turned out that storing all turn costs in separate arrays upfront speeds up edge-based CH preparation by about 25%. See #2084

getNodes

public int getNodes()

getOriginalEdges

public int getOriginalEdges()

getDegree

public int getDegree(int node)

addEdge

public void addEdge(int from,
                    int to,
                    int edge,
                    double weightFwd,
                    double weightBwd)

addShortcut

public int addShortcut(int from,
                       int to,
                       int origEdgeKeyFirst,
                       int origEdgeKeyLast,
                       int skipped1,
                       int skipped2,
                       double weight,
                       int origEdgeCount)

prepareForContraction

public void prepareForContraction()

setShortcutForPrepareEdge

public void setShortcutForPrepareEdge(int prepareEdge,
                                      int shortcut)

getShortcutForPrepareEdge

public int getShortcutForPrepareEdge(int prepareEdge)

createOutEdgeExplorer

public PrepareGraphEdgeExplorer createOutEdgeExplorer()

createInEdgeExplorer

public PrepareGraphEdgeExplorer createInEdgeExplorer()

createOutOrigEdgeExplorer

public PrepareGraphOrigEdgeExplorer createOutOrigEdgeExplorer()

createInOrigEdgeExplorer

public PrepareGraphOrigEdgeExplorer createInOrigEdgeExplorer()

getTurnWeight

public double getTurnWeight(int inEdgeKey,
                            int viaNode,
                            int outEdgeKey)

disconnect

public com.carrotsearch.hppc.IntContainer disconnect(int node)

close

public void close()