com.graphhopper.routing

Class AlternativeRouteEdgeCH

java.lang.Object

com.graphhopper.routing.AbstractBidirAlgo

com.graphhopper.routing.AbstractBidirCHAlgo

com.graphhopper.routing.AbstractBidirectionEdgeCHNoSOD

com.graphhopper.routing.DijkstraBidirectionEdgeCHNoSOD

com.graphhopper.routing.AlternativeRouteEdgeCH

All Implemented Interfaces:

BidirRoutingAlgorithm, RoutingAlgorithm

public class AlternativeRouteEdgeCH
extends DijkstraBidirectionEdgeCHNoSOD

Minimum number-of-moving-parts implementation of alternative route search with contraction hierarchies.

"Alternative Routes in Road Networks" (Abraham et al.)

Author:

michaz

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	AlternativeRouteEdgeCH.AlternativeInfo
static class	AlternativeRouteEdgeCH.PotentialAlternativeInfo

Field Summary

Fields inherited from class com.graphhopper.routing.AbstractBidirCHAlgo

allEdgeExplorer, graph, inEdgeExplorer, levelEdgeFilter, 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
AlternativeRouteEdgeCH(RoutingCHGraph graph, PMap hints)

Method Summary

Modifier and Type	Method and Description
List<Path>	calcPaths(int from, int to) Calculates multiple possibilities for a path.
boolean	finished()
int	getVisitedNodes() Returns the visited nodes after searching.

Methods inherited from class com.graphhopper.routing.DijkstraBidirectionEdgeCHNoSOD

createEntry, createStartEntry, getName, updateEntry

Methods inherited from class com.graphhopper.routing.AbstractBidirectionEdgeCHNoSOD

accept, createPathExtractor, getIncomingEdge, getOrigEdgeId, getTraversalId, postInitFrom, postInitTo, updateBestPath

Methods inherited from class com.graphhopper.routing.AbstractBidirCHAlgo

accept, calcWeight, calcWeight, createEmptyPath, extractPath, fillEdgesFromUsingFilter, fillEdgesToUsingFilter, getInEdgeWeight, getOtherNode, getTraversalId, initCollections, toString

Methods inherited from class com.graphhopper.routing.AbstractBidirAlgo

bwdSearchCanBeStopped, calcPath, calcPath, checkAlreadyRun, fromEntryCanBeSkipped, fwdSearchCanBeStopped, getCurrentFromWeight, getCurrentToWeight, initFrom, initTo, isMaxVisitedNodesExceeded, postInit, runAlgo, setMaxVisitedNodes, setUpdateBestPath, toEntryCanBeSkipped

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, setMaxVisitedNodes

Constructor Detail

AlternativeRouteEdgeCH

public AlternativeRouteEdgeCH(RoutingCHGraph graph,
                              PMap hints)

Method Detail

finished

public boolean finished()

Overrides:

finished in class AbstractBidirCHAlgo

getVisitedNodes

public int getVisitedNodes()

Description copied from interface: RoutingAlgorithm

Returns the visited nodes after searching. Useful for debugging.

Specified by:

getVisitedNodes in interface RoutingAlgorithm

Overrides:

getVisitedNodes in class AbstractBidirAlgo

calcPaths

public List<Path> calcPaths(int from,
                            int to)

Description copied from interface: RoutingAlgorithm

Calculates multiple possibilities for a path.

Specified by:

calcPaths in interface RoutingAlgorithm

Overrides:

calcPaths in class AbstractBidirAlgo

See Also:

RoutingAlgorithm.calcPath(int, int)