Package com.graphhopper.routing.lm
Class PrepareLandmarks
java.lang.Object
com.graphhopper.routing.lm.PrepareLandmarks
This class does the preprocessing for the ALT algorithm (A* , landmark, triangle inequality).
http://www.siam.org/meetings/alenex05/papers/03agoldberg.pdf
- Author:
- Peter Karich
-
Constructor Summary
ConstructorsConstructorDescriptionPrepareLandmarks
(Directory dir, BaseGraph graph, EncodedValueLookup encodedValueLookup, LMConfig lmConfig, int landmarks) -
Method Summary
Modifier and TypeMethodDescriptionvoid
doWork()
long
boolean
boolean
setAreaIndex
(AreaIndex<SplitArea> areaIndex) setLandmarkSuggestions
(List<LandmarkSuggestion> landmarkSuggestions) void
setLogDetails
(boolean logDetails) setMaximumWeight
(double maximumWeight) void
setMinimumNodes
(int nodes)
-
Constructor Details
-
PrepareLandmarks
public PrepareLandmarks(Directory dir, BaseGraph graph, EncodedValueLookup encodedValueLookup, LMConfig lmConfig, int landmarks)
-
-
Method Details
-
setLandmarkSuggestions
-
setAreaIndex
- See Also:
-
setMaximumWeight
- See Also:
-
setLMSelectionWeighting
-
setMinimumNodes
public void setMinimumNodes(int nodes) - See Also:
-
setLogDetails
-
getLandmarkStorage
-
getLMConfig
-
loadExisting
public boolean loadExisting() -
doWork
public void doWork() -
isPrepared
public boolean isPrepared() -
getTotalPrepareTime
public long getTotalPrepareTime()
-