com.graphhopper.routing

Class AbstractNonCHBidirAlgo

java.lang.Object

com.graphhopper.routing.AbstractBidirAlgo

com.graphhopper.routing.AbstractNonCHBidirAlgo

All Implemented Interfaces:

BidirRoutingAlgorithm, RoutingAlgorithm

Direct Known Subclasses:

AStarBidirection, DijkstraBidirectionRef

public abstract class AbstractNonCHBidirAlgo
extends AbstractBidirAlgo
implements BidirRoutingAlgorithm

Common subclass for bidirectional algorithms.

Author:

Peter Karich, easbar

See Also:

for bidirectional CH algorithms

Field Summary

Fields

Modifier and Type	Field and Description
protected EdgeFilter	additionalEdgeFilter
protected EdgeExplorer	edgeExplorer
protected FlagEncoder	flagEncoder
protected Graph	graph
protected EdgeFilter	inEdgeFilter
protected NodeAccess	nodeAccess
protected EdgeFilter	outEdgeFilter
protected Weighting	weighting

Fields inherited from class com.graphhopper.routing.AbstractBidirAlgo

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

Constructor Summary

Constructors

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

Method Summary

Modifier and Type	Method and Description
protected boolean	accept(EdgeIteratorState iter, int prevOrNextEdgeId)
protected double	calcWeight(EdgeIteratorState iter, SPTEntry currEdge, boolean reverse)
protected Path	createEmptyPath()
protected abstract SPTEntry	createEntry(EdgeIteratorState edge, 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(Graph graph, Weighting weighting)
protected Path	extractPath()
protected void	fillEdgesFromUsingFilter(EdgeFilter edgeFilter)
protected void	fillEdgesToUsingFilter(EdgeFilter edgeFilter)
protected double	getInEdgeWeight(SPTEntry entry)
protected int	getOtherNode(int edge, int node)
protected void	postInitFrom()
protected void	postInitTo()
String	toString()
protected void	updateEntry(SPTEntry entry, EdgeIteratorState edge, double weight, SPTEntry parent, boolean reverse)

Methods inherited from class com.graphhopper.routing.AbstractBidirAlgo

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

Field Detail

graph

protected final Graph graph

nodeAccess

protected final NodeAccess nodeAccess

weighting

protected final Weighting weighting

flagEncoder

protected final FlagEncoder flagEncoder

edgeExplorer

protected EdgeExplorer edgeExplorer

inEdgeFilter

protected EdgeFilter inEdgeFilter

outEdgeFilter

protected EdgeFilter outEdgeFilter

additionalEdgeFilter

protected EdgeFilter additionalEdgeFilter

Constructor Detail

AbstractNonCHBidirAlgo

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

Method Detail

createEntry

protected abstract SPTEntry createEntry(EdgeIteratorState edge,
                                        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

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(Graph graph,
                                                 Weighting weighting)

postInitFrom

protected void postInitFrom()

Specified by:

postInitFrom in class AbstractBidirAlgo

postInitTo

protected void postInitTo()

Specified by:

postInitTo in class AbstractBidirAlgo

fillEdgesFromUsingFilter

protected void fillEdgesFromUsingFilter(EdgeFilter edgeFilter)

Parameters:

edgeFilter - edge filter used to filter edges during fillEdgesFrom()

fillEdgesToUsingFilter

protected void fillEdgesToUsingFilter(EdgeFilter edgeFilter)

See Also:

fillEdgesFromUsingFilter(EdgeFilter)

updateEntry

protected void updateEntry(SPTEntry entry,
                           EdgeIteratorState edge,
                           double weight,
                           SPTEntry parent,
                           boolean reverse)

calcWeight

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

getInEdgeWeight

protected double getInEdgeWeight(SPTEntry entry)

Specified by:

getInEdgeWeight in class AbstractBidirAlgo

getOtherNode

protected int getOtherNode(int edge,
                           int node)

Specified by:

getOtherNode in class AbstractBidirAlgo

extractPath

protected Path extractPath()

Specified by:

extractPath in class AbstractBidirAlgo

accept

protected boolean accept(EdgeIteratorState iter,
                         int prevOrNextEdgeId)

createEmptyPath

protected Path createEmptyPath()

toString

public String toString()

Overrides:

toString in class Object