public abstract class AbstractBidirAlgo extends AbstractRoutingAlgorithm
| Modifier and Type | Field and Description |
|---|---|
protected boolean |
finishedFrom |
protected boolean |
finishedTo |
flagEncoder, graph, inEdgeExplorer, maxVisitedNodes, nodeAccess, outEdgeExplorer, traversalMode, weighting| Constructor and Description |
|---|
AbstractBidirAlgo(Graph graph,
Weighting weighting,
TraversalMode tMode) |
| Modifier and Type | Method and Description |
|---|---|
Path |
calcPath(int from,
int to)
Calculates the best path between the specified nodes.
|
protected abstract Path |
createAndInitPath() |
protected abstract double |
getCurrentFromWeight() |
protected abstract double |
getCurrentToWeight() |
int |
getVisitedNodes()
Returns the visited nodes after searching.
|
protected void |
runAlgo() |
accept, calcPaths, checkAlreadyRun, createEmptyPath, createSPTEntry, extractPath, finished, getName, isMaxVisitedNodesExceeded, setEdgeFilter, setMaxVisitedNodes, toString, updateBestPathpublic AbstractBidirAlgo(Graph graph, Weighting weighting, TraversalMode tMode)
protected abstract Path createAndInitPath()
protected abstract double getCurrentFromWeight()
protected abstract double getCurrentToWeight()
public Path calcPath(int from, int to)
RoutingAlgorithmprotected void runAlgo()
public int getVisitedNodes()
RoutingAlgorithmCopyright © 2012–2018. All rights reserved.