com.graphhopper.routing

Class PathBidirRef

java.lang.Object

com.graphhopper.routing.Path

com.graphhopper.routing.PathBidirRef

Direct Known Subclasses:

Path4CH

public class PathBidirRef
extends Path

This class creates a DijkstraPath from two Edge's resulting from a BidirectionalDijkstra

Author:

Peter Karich

Nested Class Summary

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

Path.EdgeVisitor

Field Summary

Fields

Modifier and Type	Field and Description
protected SPTEntry	edgeTo

Fields inherited from class com.graphhopper.routing.Path

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

Constructor Summary

Constructors

Constructor and Description
PathBidirRef(Graph g, Weighting weighting)

Method Summary

Modifier and Type	Method and Description
Path	extract() Extracts path from two shortest-path-tree
protected int	getIncEdge(SPTEntry entry)
protected void	processEdgeBwd(int edgeId, int adjNode, int nextEdgeId) Similar to Path.processEdge(int, int, int), but with the situation we encounter when doing a backward search: nextEdgeId--x<--edgeId--adjNode
PathBidirRef	setSPTEntryTo(SPTEntry edgeTo)
PathBidirRef	setSwitchToFrom(boolean b)

Methods inherited from class com.graphhopper.routing.Path

addEdge, calcDetails, calcEdges, calcInstructions, calcNodes, calcPoints, getDebugInfo, getDescription, getDistance, getEdgeCount, getExtractTime, getFinalEdge, getTime, getWeight, isFound, processEdge, 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

Field Detail

edgeTo

protected SPTEntry edgeTo

Constructor Detail

PathBidirRef

public PathBidirRef(Graph g,
                    Weighting weighting)

Method Detail

setSwitchToFrom

public PathBidirRef setSwitchToFrom(boolean b)

setSPTEntryTo

public PathBidirRef setSPTEntryTo(SPTEntry edgeTo)

extract

public Path extract()

Extracts path from two shortest-path-tree

Overrides:

extract in class Path

processEdgeBwd

protected void processEdgeBwd(int edgeId,
                              int adjNode,
                              int nextEdgeId)

Similar to Path.processEdge(int, int, int), but with the situation we encounter when doing a backward search: nextEdgeId--x<--edgeId--adjNode

getIncEdge

protected int getIncEdge(SPTEntry entry)