public class Path4CH extends PathBidirRef
Path.EdgeVisitoredgeTo| Constructor and Description |
|---|
Path4CH(Graph routingGraph,
Graph baseGraph,
Weighting weighting) |
| Modifier and Type | Method and Description |
|---|---|
protected ShortcutUnpacker |
getShortcutUnpacker(Graph routingGraph,
Weighting weighting) |
protected void |
processEdge(int edgeId,
int adjNode,
int prevEdgeId)
Calculates the distance and time of the specified edgeId.
|
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 |
extract, getIncEdge, setSPTEntryTo, setSwitchToFromaddEdge, calcDetails, calcEdges, calcInstructions, calcNodes, calcPoints, getDebugInfo, getDescription, getDistance, getEdgeCount, getExtractTime, getFinalEdge, getTime, getWeight, isFound, setDescription, setDistance, setEndNode, setFound, setFromNode, setSPTEntry, setWeight, toDetailsString, toStringprotected final void processEdge(int edgeId,
int adjNode,
int prevEdgeId)
PathprocessEdge in class PathprevEdgeId - the edge that comes before edgeId: --prevEdgeId-x-edgeId-->adjNodeprotected void processEdgeBwd(int edgeId,
int adjNode,
int nextEdgeId)
PathBidirRefPath.processEdge(int, int, int), but with the situation we encounter when doing a backward
search: nextEdgeId--x<--edgeId--adjNodeprocessEdgeBwd in class PathBidirRefprotected ShortcutUnpacker getShortcutUnpacker(Graph routingGraph, Weighting weighting)
Copyright © 2012–2019. All rights reserved.