Package com.graphhopper.routing.ch
Class PrepareContractionHierarchies
java.lang.Object
com.graphhopper.routing.ch.PrepareContractionHierarchies
This class prepares the graph for a bidirectional algorithm supporting contraction hierarchies
ie. an algorithm returned by createAlgo.
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.
- Author:
- Peter Karich
-
Nested Class Summary
Nested Classes -
Method Summary
Modifier and TypeMethodDescriptiondoWork()
long
boolean
toString()
useFixedNodeOrdering
(NodeOrderingProvider nodeOrderingProvider) Instead of heuristically determining a node ordering for the graph contraction it is also possible to use a fixed ordering.
-
Method Details
-
fromGraph
-
setParams
-
useFixedNodeOrdering
public PrepareContractionHierarchies useFixedNodeOrdering(NodeOrderingProvider nodeOrderingProvider) Instead of heuristically determining a node ordering for the graph contraction it is also possible to use a fixed ordering. For example this allows re-using a previously calculated node ordering. This will speed up CH preparation, but might lead to slower queries. -
doWork
-
isPrepared
public boolean isPrepared() -
getCHConfig
-
getTotalPrepareTime
public long getTotalPrepareTime() -
toString
-