Package com.graphhopper.routing

Class AStarBidirectionCH

java.lang.Object

com.graphhopper.routing.AbstractBidirAlgo

com.graphhopper.routing.AbstractBidirCHAlgo

com.graphhopper.routing.AStarBidirectionCH

All Implemented Interfaces:

EdgeToEdgeRoutingAlgorithm, RoutingAlgorithm

public class AStarBidirectionCH
extends AbstractBidirCHAlgo

See Also:

• AStarBidirection

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

Constructor	Description
AStarBidirectionCH(RoutingCHGraph graph)

Method Summary

Modifier and Type	Method	Description
protected double	calcWeight(RoutingCHEdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
protected SPTEntry	createEntry(int edge, int adjNode, 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, int edge, int adjNode, int incEdge, double weight, SPTEntry parent, boolean reverse)

Methods inherited from class com.graphhopper.routing.AbstractBidirCHAlgo

accept, calcWeight, createEmptyPath, extractPath, fillEdgesFromUsingFilter, fillEdgesToUsingFilter, finished, getInEdgeWeight, initCollections, postInitFrom, postInitTo, setPathExtractorSupplier, toString

Methods inherited from class com.graphhopper.routing.AbstractBidirAlgo

bwdSearchCanBeStopped, calcPath, calcPath, calcPaths, checkAlreadyRun, fromEntryCanBeSkipped, fwdSearchCanBeStopped, getCurrentFromWeight, getCurrentToWeight, getIncomingEdge, getVisitedNodes, initFrom, initTo, isMaxVisitedNodesExceeded, isTimeoutExceeded, postInit, runAlgo, setMaxVisitedNodes, setTimeoutMillis, setUpdateBestPath, setupFinishTime, toEntryCanBeSkipped, updateBestPath

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

AStarBidirectionCH

public AStarBidirectionCH(RoutingCHGraph graph)

Method Details

createStartEntry

protected SPTEntry createStartEntry(int node,
 double weight,
 boolean reverse)

Description copied from class: AbstractBidirAlgo

Creates the root shortest path tree entry for the forward or backward search.

Specified by:

createStartEntry in class AbstractBidirAlgo

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 (a SPTEntry or one of its subclasses) during a dijkstra expansion.

Specified by:

createEntry in class AbstractBidirCHAlgo

Parameters:

edge - the id of the edge that is currently processed for the expansion

adjNode - the adjacent node of the edge

incEdge - 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 node

weight - the weight the shortest path three entry should carry

parent - the parent entry of in the shortest path tree

reverse - 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 class AbstractBidirCHAlgo

calcWeight

protected double calcWeight(RoutingCHEdgeIteratorState iter,
 SPTEntry currEdge,
 boolean reverse)

Overrides:

calcWeight in class AbstractBidirCHAlgo

getApproximation

public WeightApproximator getApproximation()

setApproximation

public AStarBidirectionCH setApproximation(WeightApproximator approx)

Parameters:

approx - if true it enables approximate distance calculation from lat,lon values

getName

public String getName()

Specified by:

getName in interface RoutingAlgorithm

Overrides:

getName in class AbstractBidirAlgo

Returns:

name of this algorithm