Package com.graphhopper.routing
Class AStarBidirectionEdgeCHNoSOD
java.lang.Object
com.graphhopper.routing.AbstractBidirAlgo
com.graphhopper.routing.AbstractBidirCHAlgo
com.graphhopper.routing.AbstractBidirectionEdgeCHNoSOD
com.graphhopper.routing.AStarBidirectionEdgeCHNoSOD
- All Implemented Interfaces:
EdgeToEdgeRoutingAlgorithm
,RoutingAlgorithm
- Author:
- easbar
-
Field Summary
Fields inherited from class com.graphhopper.routing.AbstractBidirCHAlgo
graph, inEdgeExplorer, levelEdgeFilter, nodeAccess, outEdgeExplorer
Fields inherited from class com.graphhopper.routing.AbstractBidirAlgo
bestBwdEntry, bestFwdEntry, bestWeight, bestWeightMapFrom, bestWeightMapOther, bestWeightMapTo, currFrom, currTo, finishedFrom, finishedTo, from, fromOutEdge, maxVisitedNodes, timeoutMillis, to, toInEdge, traversalMode, updateBestPath
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprotected boolean
protected SPTEntry
createEntry
(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse) Creates a new entry of the shortest path tree (aSPTEntry
or one of its subclasses) during a dijkstra expansion.protected AStarCHEntry
createStartEntry
(int node, double weight, boolean reverse) Creates the root shortest path tree entry for the forward or backward search.protected boolean
protected boolean
getName()
void
init
(int from, double fromWeight, int to, double toWeight) setApproximation
(WeightApproximator weightApproximator) protected boolean
protected void
updateEntry
(SPTEntry entry, int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse) Methods inherited from class com.graphhopper.routing.AbstractBidirectionEdgeCHNoSOD
accept, getIncomingEdge, postInitFrom, postInitTo, updateBestPath
Methods inherited from class com.graphhopper.routing.AbstractBidirCHAlgo
calcWeight, calcWeight, createEmptyPath, extractPath, fillEdgesFromUsingFilter, fillEdgesToUsingFilter, finished, getInEdgeWeight, initCollections, setPathExtractorSupplier, toString
Methods inherited from class com.graphhopper.routing.AbstractBidirAlgo
calcPath, calcPath, calcPaths, checkAlreadyRun, getCurrentFromWeight, getCurrentToWeight, getVisitedNodes, initFrom, initTo, isMaxVisitedNodesExceeded, isTimeoutExceeded, postInit, runAlgo, setMaxVisitedNodes, setTimeoutMillis, setUpdateBestPath, setupFinishTime
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
Methods inherited from interface com.graphhopper.routing.EdgeToEdgeRoutingAlgorithm
calcPath
Methods inherited from interface com.graphhopper.routing.RoutingAlgorithm
calcPath, calcPaths, getVisitedNodes, setMaxVisitedNodes, setTimeoutMillis
-
Constructor Details
-
AStarBidirectionEdgeCHNoSOD
-
-
Method Details
-
init
public void init(int from, double fromWeight, int to, double toWeight) -
fromEntryCanBeSkipped
protected boolean fromEntryCanBeSkipped()- Overrides:
fromEntryCanBeSkipped
in classAbstractBidirAlgo
-
toEntryCanBeSkipped
protected boolean toEntryCanBeSkipped()- Overrides:
toEntryCanBeSkipped
in classAbstractBidirAlgo
-
fwdSearchCanBeStopped
protected boolean fwdSearchCanBeStopped()- Overrides:
fwdSearchCanBeStopped
in classAbstractBidirAlgo
-
bwdSearchCanBeStopped
protected boolean bwdSearchCanBeStopped()- Overrides:
bwdSearchCanBeStopped
in classAbstractBidirAlgo
-
createStartEntry
Description copied from class:AbstractBidirAlgo
Creates the root shortest path tree entry for the forward or backward search.- Specified by:
createStartEntry
in classAbstractBidirAlgo
-
createEntry
protected SPTEntry createEntry(int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse) Description copied from class:AbstractBidirCHAlgo
Creates a new entry of the shortest path tree (aSPTEntry
or one of its subclasses) during a dijkstra expansion.- Specified by:
createEntry
in classAbstractBidirCHAlgo
- Parameters:
edge
- the id of the edge that is currently processed for the expansionadjNode
- the adjacent node of the edgeincEdge
- the id of the edge that is incoming to the node the edge is pointed at. usually this is the same as edge, but for edge-based CH and in case edge corresponds to a shortcut incEdge is the original edge that is incoming to the nodeweight
- the weight the shortest path three entry should carryparent
- the parent entry of in the shortest path treereverse
- true if we are currently looking at the backward search, false otherwise
-
updateEntry
protected void updateEntry(SPTEntry entry, int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse) - Overrides:
updateEntry
in classAbstractBidirCHAlgo
-
getApproximation
-
setApproximation
-
getName
- Specified by:
getName
in interfaceRoutingAlgorithm
- Overrides:
getName
in classAbstractBidirAlgo
- Returns:
- name of this algorithm
-