com.graphhopper.routing

Class DijkstraBidirectionRef

java.lang.Object

com.graphhopper.routing.AbstractBidirAlgo

com.graphhopper.routing.AbstractNonCHBidirAlgo

com.graphhopper.routing.DijkstraBidirectionRef

All Implemented Interfaces:

BidirRoutingAlgorithm, RoutingAlgorithm

public class DijkstraBidirectionRef
extends AbstractNonCHBidirAlgo

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 inherited from class com.graphhopper.routing.AbstractNonCHBidirAlgo

additionalEdgeFilter, edgeExplorer, flagEncoder, graph, inEdgeFilter, outEdgeFilter, weighting

Fields inherited from class com.graphhopper.routing.AbstractBidirAlgo

bestBwdEntry, bestFwdEntry, bestWeight, bestWeightMapFrom, bestWeightMapOther, bestWeightMapTo, currFrom, currTo, finishedFrom, finishedTo, from, fromOutEdge, maxVisitedNodes, nodeAccess, to, toInEdge, traversalMode, updateBestPath

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method and Description
protected SPTEntry	createEntry(EdgeIteratorState 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.
String	getName()
protected SPTEntry	getParent(SPTEntry entry)

Methods inherited from class com.graphhopper.routing.AbstractNonCHBidirAlgo

accept, accept, calcWeight, createEmptyPath, createPathExtractor, extractPath, fillEdgesFromUsingFilter, fillEdgesToUsingFilter, getInEdgeWeight, getOrigEdgeId, getOtherNode, getTraversalId, postInitFrom, postInitTo, toString, updateEntry

Methods inherited from class com.graphhopper.routing.AbstractBidirAlgo

bwdSearchCanBeStopped, calcPath, calcPath, calcPaths, checkAlreadyRun, finished, fromEntryCanBeSkipped, fwdSearchCanBeStopped, getCurrentFromWeight, getCurrentToWeight, getIncomingEdge, getVisitedNodes, initCollections, initFrom, initTo, isMaxVisitedNodesExceeded, postInit, runAlgo, setMaxVisitedNodes, setUpdateBestPath, 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.BidirRoutingAlgorithm

calcPath

Methods inherited from interface com.graphhopper.routing.RoutingAlgorithm

calcPath, calcPaths, getVisitedNodes, setMaxVisitedNodes

Constructor Detail

DijkstraBidirectionRef

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

Method Detail

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(EdgeIteratorState edge,
                               int incEdge,
                               double weight,
                               SPTEntry parent,
                               boolean reverse)

Description copied from class: AbstractNonCHBidirAlgo

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 AbstractNonCHBidirAlgo

Parameters:

edge - the edge that is currently processed for the expansion

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

getParent

protected SPTEntry getParent(SPTEntry entry)

getName

public String getName()

Specified by:

getName in interface RoutingAlgorithm

Overrides:

getName in class AbstractBidirAlgo

Returns:

name of this algorithm