com.graphhopper.routing

Class AbstractBidirCHAlgo

java.lang.Object

com.graphhopper.routing.AbstractBidirAlgo

com.graphhopper.routing.AbstractBidirCHAlgo

All Implemented Interfaces:

BidirRoutingAlgorithm, RoutingAlgorithm

Direct Known Subclasses:

AbstractBidirectionEdgeCHNoSOD, AStarBidirectionCH, DijkstraBidirectionCHNoSOD

public abstract class AbstractBidirCHAlgo
extends AbstractBidirAlgo
implements BidirRoutingAlgorithm

Common subclass for bidirectional CH algorithms.

Author:

Peter Karich, easbar

See Also:

for non-CH bidirectional algorithms

Field Summary

Fields

Modifier and Type	Field and Description
protected RoutingCHEdgeExplorer	allEdgeExplorer
protected RoutingCHGraph	graph
protected RoutingCHEdgeExplorer	inEdgeExplorer
protected CHEdgeFilter	levelEdgeFilter
protected RoutingCHEdgeExplorer	outEdgeExplorer

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
AbstractBidirCHAlgo(RoutingCHGraph graph, TraversalMode tMode)

Method Summary

Modifier and Type	Method and Description
protected boolean	accept(RoutingCHEdgeIteratorState iter, int prevOrNextEdgeId)
protected boolean	accept(RoutingCHEdgeIteratorState edge, SPTEntry currEdge, boolean reverse)
protected double	calcWeight(RoutingCHEdgeIteratorState edgeState, boolean reverse, int prevOrNextEdgeId)
protected double	calcWeight(RoutingCHEdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
protected Path	createEmptyPath()
protected abstract 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 BidirPathExtractor	createPathExtractor(RoutingCHGraph graph)
protected Path	extractPath()
protected void	fillEdgesFromUsingFilter(CHEdgeFilter edgeFilter)
protected void	fillEdgesToUsingFilter(CHEdgeFilter edgeFilter)
boolean	finished()
protected double	getInEdgeWeight(SPTEntry entry)
protected int	getOrigEdgeId(RoutingCHEdgeIteratorState edge, boolean reverse)
protected int	getOtherNode(int edge, int node)
protected int	getTraversalId(RoutingCHEdgeIteratorState edge, boolean reverse)
protected int	getTraversalId(RoutingCHEdgeIteratorState edge, int origEdgeId, boolean reverse)
protected void	initCollections(int size)
protected void	postInitFrom()
protected void	postInitTo()
String	toString()
protected void	updateEntry(SPTEntry entry, RoutingCHEdgeIteratorState edge, int edgeId, double weight, SPTEntry parent, boolean reverse)

Methods inherited from class com.graphhopper.routing.AbstractBidirAlgo

bwdSearchCanBeStopped, calcPath, calcPath, calcPaths, checkAlreadyRun, createStartEntry, fromEntryCanBeSkipped, fwdSearchCanBeStopped, getCurrentFromWeight, getCurrentToWeight, getIncomingEdge, getName, getVisitedNodes, 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, getName, getVisitedNodes, setMaxVisitedNodes

Field Detail

graph

protected final RoutingCHGraph graph

allEdgeExplorer

protected RoutingCHEdgeExplorer allEdgeExplorer

inEdgeExplorer

protected RoutingCHEdgeExplorer inEdgeExplorer

outEdgeExplorer

protected RoutingCHEdgeExplorer outEdgeExplorer

levelEdgeFilter

protected CHEdgeFilter levelEdgeFilter

Constructor Detail

AbstractBidirCHAlgo

public AbstractBidirCHAlgo(RoutingCHGraph graph,
                           TraversalMode tMode)

Method Detail

initCollections

protected void initCollections(int size)

Overrides:

initCollections in class AbstractBidirAlgo

createEntry

protected abstract 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.

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

createPathExtractor

protected BidirPathExtractor createPathExtractor(RoutingCHGraph graph)

postInitFrom

protected void postInitFrom()

Specified by:

postInitFrom in class AbstractBidirAlgo

postInitTo

protected void postInitTo()

Specified by:

postInitTo in class AbstractBidirAlgo

fillEdgesFromUsingFilter

protected void fillEdgesFromUsingFilter(CHEdgeFilter edgeFilter)

Parameters:

edgeFilter - edge filter used to fill edges. the levelEdgeFilter reference will be set to edgeFilter by this method, so make sure edgeFilter does not use it directly.

fillEdgesToUsingFilter

protected void fillEdgesToUsingFilter(CHEdgeFilter edgeFilter)

See Also:

fillEdgesFromUsingFilter(CHEdgeFilter)

finished

public boolean finished()

Overrides:

finished in class AbstractBidirAlgo

calcWeight

protected double calcWeight(RoutingCHEdgeIteratorState edgeState,
                            boolean reverse,
                            int prevOrNextEdgeId)

updateEntry

protected void updateEntry(SPTEntry entry,
                           RoutingCHEdgeIteratorState edge,
                           int edgeId,
                           double weight,
                           SPTEntry parent,
                           boolean reverse)

accept

protected boolean accept(RoutingCHEdgeIteratorState edge,
                         SPTEntry currEdge,
                         boolean reverse)

getOrigEdgeId

protected int getOrigEdgeId(RoutingCHEdgeIteratorState edge,
                            boolean reverse)

getTraversalId

protected int getTraversalId(RoutingCHEdgeIteratorState edge,
                             int origEdgeId,
                             boolean reverse)

getTraversalId

protected int getTraversalId(RoutingCHEdgeIteratorState edge,
                             boolean reverse)

getOtherNode

protected int getOtherNode(int edge,
                           int node)

Specified by:

getOtherNode in class AbstractBidirAlgo

calcWeight

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

getInEdgeWeight

protected double getInEdgeWeight(SPTEntry entry)

Specified by:

getInEdgeWeight in class AbstractBidirAlgo

extractPath

protected Path extractPath()

Specified by:

extractPath in class AbstractBidirAlgo

accept

protected boolean accept(RoutingCHEdgeIteratorState iter,
                         int prevOrNextEdgeId)

createEmptyPath

protected Path createEmptyPath()

toString

public String toString()

Overrides:

toString in class Object