com.graphhopper.routing.ch

Class Path4CH

java.lang.Object

com.graphhopper.routing.Path

com.graphhopper.routing.PathBidirRef

com.graphhopper.routing.ch.Path4CH

public class Path4CH
extends PathBidirRef

Recursively unpack shortcuts.

Author:

Peter Karich

See Also:

PrepareContractionHierarchies

Nested Class Summary

Nested classes/interfaces inherited from class com.graphhopper.routing.Path

Path.EdgeVisitor

Field Summary

Fields inherited from class com.graphhopper.routing.PathBidirRef

edgeTo

Fields inherited from class com.graphhopper.routing.Path

distance, endNode, graph, reverseOrder, sptEntry, time, weighting

Constructor Summary

Constructors

Constructor and Description
Path4CH(Graph routingGraph, Graph baseGraph, Weighting weighting)

Method Summary

Modifier and Type	Method and Description
protected void	processEdge(int edgeId, int endNode, int prevEdgeId) Calculates the distance and time of the specified edgeId.

Methods inherited from class com.graphhopper.routing.PathBidirRef

extract, setSPTEntryTo, setSwitchToFrom

Methods inherited from class com.graphhopper.routing.Path

addEdge, calcDetails, calcEdges, calcInstructions, calcNodes, calcPoints, getDebugInfo, getDescription, getDistance, getEdgeCount, getExtractTime, getFinalEdge, getTime, getWeight, isFound, setDescription, setDistance, setEndNode, setFound, setFromNode, setSPTEntry, setWeight, toDetailsString, toString

Methods inherited from class java.lang.Object

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

Constructor Detail

Path4CH

public Path4CH(Graph routingGraph,
               Graph baseGraph,
               Weighting weighting)

Method Detail

processEdge

protected final void processEdge(int edgeId,
                                 int endNode,
                                 int prevEdgeId)

Description copied from class: Path

Calculates the distance and time of the specified edgeId. Also it adds the edgeId to the path list.

Overrides:

processEdge in class Path

prevEdgeId - here the edge that comes before edgeId is necessary. I.e. for the reverse search we need the next edge.