public class PrepareContractionHierarchies extends AbstractAlgoPreparation implements RoutingAlgorithmFactory
There are several descriptions of contraction hierarchies available. The following is one of the more detailed: http://web.cs.du.edu/~sturtevant/papers/highlevelpathfinding.pdf
The only difference is that we use two skipped edges instead of one skipped node for faster unpacking.
| Constructor and Description |
|---|
PrepareContractionHierarchies(Directory dir,
GraphHopperStorage ghStorage,
CHGraph chGraph,
TraversalMode traversalMode) |
| Modifier and Type | Method and Description |
|---|---|
RoutingAlgorithm |
createAlgo(Graph graph,
AlgorithmOptions opts)
This method creates an algorithm out of this factory based on the specified opts and graph.
|
void |
doSpecificWork() |
long |
getDijkstraCount() |
double |
getLazyTime() |
double |
getNeighborTime() |
double |
getPeriodTime() |
long |
getShortcuts() |
Weighting |
getWeighting() |
protected void |
runGraphContraction() |
PrepareContractionHierarchies |
setParams(PMap pMap) |
String |
toString() |
doWork, isPreparedpublic PrepareContractionHierarchies(Directory dir, GraphHopperStorage ghStorage, CHGraph chGraph, TraversalMode traversalMode)
public PrepareContractionHierarchies setParams(PMap pMap)
public void doSpecificWork()
doSpecificWork in class AbstractAlgoPreparationprotected void runGraphContraction()
public RoutingAlgorithm createAlgo(Graph graph, AlgorithmOptions opts)
RoutingAlgorithmFactorycreateAlgo in interface RoutingAlgorithmFactorypublic long getDijkstraCount()
public long getShortcuts()
public double getLazyTime()
public double getPeriodTime()
public double getNeighborTime()
public Weighting getWeighting()
Copyright © 2012–2018. All rights reserved.