com.graphhopper.routing

Class DijkstraBidirectionRef

java.lang.Object

com.graphhopper.routing.AbstractRoutingAlgorithm

com.graphhopper.routing.AbstractBidirAlgo

com.graphhopper.routing.DijkstraBidirectionRef

All Implemented Interfaces:

RoutingAlgorithm

Direct Known Subclasses:

DijkstraBidirectionCHNoSOD

public class DijkstraBidirectionRef
extends AbstractBidirAlgo

Calculates best path in bidirectional way.

'Ref' stands for reference implementation and is using the normal Java-'reference'-way.

Author:

Peter Karich

Field Summary

Fields

Modifier and Type	Field and Description
protected PathBidirRef	bestPath
protected com.carrotsearch.hppc.IntObjectMap<SPTEntry>	bestWeightMapFrom
protected com.carrotsearch.hppc.IntObjectMap<SPTEntry>	bestWeightMapOther
protected com.carrotsearch.hppc.IntObjectMap<SPTEntry>	bestWeightMapTo
protected SPTEntry	currFrom
protected SPTEntry	currTo

Fields inherited from class com.graphhopper.routing.AbstractBidirAlgo

finishedFrom, finishedTo

Fields inherited from class com.graphhopper.routing.AbstractRoutingAlgorithm

flagEncoder, graph, inEdgeExplorer, maxVisitedNodes, nodeAccess, outEdgeExplorer, traversalMode, weighting

Constructor Summary

Constructors

Constructor and Description
DijkstraBidirectionRef(Graph graph, Weighting weighting, TraversalMode tMode)

Method Summary

Modifier and Type	Method and Description
protected Path	createAndInitPath()
protected Path	extractPath() To be overwritten from extending class.
boolean	fillEdgesFrom()
boolean	fillEdgesTo()
boolean	finished() To be overwritten from extending class.
protected double	getCurrentFromWeight()
protected double	getCurrentToWeight()
String	getName()
protected void	initCollections(int size)
void	initFrom(int from, double weight)
void	initTo(int to, double weight)
protected void	setUpdateBestPath(boolean b)
protected void	updateBestPath(EdgeIteratorState edgeState, SPTEntry entryCurrent, int traversalId)

Methods inherited from class com.graphhopper.routing.AbstractBidirAlgo

calcPath, getVisitedNodes, runAlgo

Methods inherited from class com.graphhopper.routing.AbstractRoutingAlgorithm

accept, calcPaths, checkAlreadyRun, createEmptyPath, createSPTEntry, isMaxVisitedNodesExceeded, setEdgeFilter, setMaxVisitedNodes, toString

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

bestWeightMapFrom

protected com.carrotsearch.hppc.IntObjectMap<SPTEntry> bestWeightMapFrom

bestWeightMapTo

protected com.carrotsearch.hppc.IntObjectMap<SPTEntry> bestWeightMapTo

bestWeightMapOther

protected com.carrotsearch.hppc.IntObjectMap<SPTEntry> bestWeightMapOther

currFrom

protected SPTEntry currFrom

currTo

protected SPTEntry currTo

bestPath

protected PathBidirRef bestPath

Constructor Detail

DijkstraBidirectionRef

public DijkstraBidirectionRef(Graph graph,
                              Weighting weighting,
                              TraversalMode tMode)

Method Detail

initCollections

protected void initCollections(int size)

initFrom

public void initFrom(int from,
                     double weight)

initTo

public void initTo(int to,
                   double weight)

createAndInitPath

protected Path createAndInitPath()

Specified by:

createAndInitPath in class AbstractBidirAlgo

extractPath

protected Path extractPath()

Description copied from class: AbstractRoutingAlgorithm

To be overwritten from extending class. Should we make this available in RoutingAlgorithm interface?

Specified by:

extractPath in class AbstractRoutingAlgorithm

Returns:

true if finished.

getCurrentFromWeight

protected double getCurrentFromWeight()

Specified by:

getCurrentFromWeight in class AbstractBidirAlgo

getCurrentToWeight

protected double getCurrentToWeight()

Specified by:

getCurrentToWeight in class AbstractBidirAlgo

fillEdgesFrom

public boolean fillEdgesFrom()

fillEdgesTo

public boolean fillEdgesTo()

finished

public boolean finished()

Description copied from class: AbstractRoutingAlgorithm

To be overwritten from extending class. Should we make this available in RoutingAlgorithm interface?

Specified by:

finished in class AbstractRoutingAlgorithm

Returns:

true if finished.

updateBestPath

protected void updateBestPath(EdgeIteratorState edgeState,
                              SPTEntry entryCurrent,
                              int traversalId)

Overrides:

updateBestPath in class AbstractRoutingAlgorithm

setUpdateBestPath

protected void setUpdateBestPath(boolean b)

getName

public String getName()

Specified by:

getName in interface RoutingAlgorithm

Overrides:

getName in class AbstractRoutingAlgorithm

Returns:

name of this algorithm