public class AStarBidirectionEdgeCHNoSOD extends AbstractBidirectionEdgeCHNoSOD
allEdgeExplorer, graph, inEdgeExplorer, levelEdgeFilter, outEdgeExplorer
bestBwdEntry, bestFwdEntry, bestWeight, bestWeightMapFrom, bestWeightMapOther, bestWeightMapTo, currFrom, currTo, finishedFrom, finishedTo, from, fromOutEdge, maxVisitedNodes, nodeAccess, to, toInEdge, traversalMode, updateBestPath
Constructor and Description |
---|
AStarBidirectionEdgeCHNoSOD(RoutingCHGraph graph) |
Modifier and Type | Method and Description |
---|---|
protected boolean |
bwdSearchCanBeStopped() |
protected SPTEntry |
createEntry(RoutingCHEdgeIteratorState edge,
int incEdge,
double weight,
SPTEntry parent,
boolean reverse)
Creates a new entry of the shortest path tree (a
SPTEntry 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 |
fwdSearchCanBeStopped() |
WeightApproximator |
getApproximation() |
String |
getName() |
void |
init(int from,
double fromWeight,
int to,
double toWeight) |
AStarBidirectionEdgeCHNoSOD |
setApproximation(WeightApproximator weightApproximator) |
protected void |
updateEntry(SPTEntry entry,
RoutingCHEdgeIteratorState edge,
int edgeId,
double weight,
SPTEntry parent,
boolean reverse) |
accept, createPathExtractor, getIncomingEdge, getOrigEdgeId, getTraversalId, postInitFrom, postInitTo, updateBestPath
accept, calcWeight, calcWeight, createEmptyPath, extractPath, fillEdgesFromUsingFilter, fillEdgesToUsingFilter, finished, getInEdgeWeight, getOtherNode, getTraversalId, initCollections, toString
calcPath, calcPath, calcPaths, checkAlreadyRun, fromEntryCanBeSkipped, getCurrentFromWeight, getCurrentToWeight, getVisitedNodes, initFrom, initTo, isMaxVisitedNodesExceeded, postInit, runAlgo, setMaxVisitedNodes, setUpdateBestPath, toEntryCanBeSkipped
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
calcPath
calcPath, calcPaths, getVisitedNodes, setMaxVisitedNodes
public AStarBidirectionEdgeCHNoSOD(RoutingCHGraph graph)
public void init(int from, double fromWeight, int to, double toWeight)
protected boolean fwdSearchCanBeStopped()
fwdSearchCanBeStopped
in class AbstractBidirAlgo
protected boolean bwdSearchCanBeStopped()
bwdSearchCanBeStopped
in class AbstractBidirAlgo
protected AStarCHEntry createStartEntry(int node, double weight, boolean reverse)
AbstractBidirAlgo
createStartEntry
in class AbstractBidirAlgo
protected SPTEntry createEntry(RoutingCHEdgeIteratorState edge, int incEdge, double weight, SPTEntry parent, boolean reverse)
AbstractBidirCHAlgo
SPTEntry
or one of its subclasses) during a dijkstra
expansion.createEntry
in class AbstractBidirCHAlgo
edge
- the edge that is currently processed for the expansionincEdge
- the id of the edge that is incoming to the node the edge is pointed at. usually this is the same as
edge.getEdge(), but for edge-based CH and in case edge is 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 otherwiseprotected void updateEntry(SPTEntry entry, RoutingCHEdgeIteratorState edge, int edgeId, double weight, SPTEntry parent, boolean reverse)
updateEntry
in class AbstractBidirCHAlgo
public WeightApproximator getApproximation()
public AStarBidirectionEdgeCHNoSOD setApproximation(WeightApproximator weightApproximator)
public String getName()
getName
in interface RoutingAlgorithm
getName
in class AbstractBidirAlgo
Copyright © 2012–2020. All rights reserved.