public class AStarBidirectionCH extends AbstractBidirCHAlgo
AStarBidirection
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 |
---|
AStarBidirectionCH(RoutingCHGraph graph) |
Modifier and Type | Method and Description |
---|---|
protected double |
calcWeight(RoutingCHEdgeIteratorState iter,
SPTEntry currEdge,
boolean reverse) |
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 SPTEntry |
createStartEntry(int node,
double weight,
boolean reverse)
Creates the root shortest path tree entry for the forward or backward search.
|
WeightApproximator |
getApproximation() |
String |
getName() |
AStarBidirectionCH |
setApproximation(WeightApproximator approx) |
protected void |
updateEntry(SPTEntry entry,
RoutingCHEdgeIteratorState edge,
int edgeId,
double weight,
SPTEntry parent,
boolean reverse) |
accept, accept, calcWeight, createEmptyPath, createPathExtractor, extractPath, fillEdgesFromUsingFilter, fillEdgesToUsingFilter, finished, getInEdgeWeight, getOrigEdgeId, getOtherNode, getTraversalId, getTraversalId, initCollections, postInitFrom, postInitTo, toString
bwdSearchCanBeStopped, calcPath, calcPath, calcPaths, checkAlreadyRun, fromEntryCanBeSkipped, fwdSearchCanBeStopped, getCurrentFromWeight, getCurrentToWeight, getIncomingEdge, getVisitedNodes, initFrom, initTo, isMaxVisitedNodesExceeded, postInit, runAlgo, setMaxVisitedNodes, setUpdateBestPath, toEntryCanBeSkipped, updateBestPath
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
calcPath
calcPath, calcPaths, getVisitedNodes, setMaxVisitedNodes
public AStarBidirectionCH(RoutingCHGraph graph)
protected SPTEntry 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
protected double calcWeight(RoutingCHEdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
calcWeight
in class AbstractBidirCHAlgo
public WeightApproximator getApproximation()
public AStarBidirectionCH setApproximation(WeightApproximator approx)
approx
- if true it enables approximate distance calculation from lat,lon valuespublic String getName()
getName
in interface RoutingAlgorithm
getName
in class AbstractBidirAlgo
Copyright © 2012–2020. All rights reserved.