public class DijkstraBidirectionRef extends AbstractBidirAlgo
'Ref' stands for reference implementation and is using the normal Java-'reference'-way.
bestPath, bestWeightMapFrom, bestWeightMapOther, bestWeightMapTo, currFrom, currTo, finishedFrom, finishedTo
additionalEdgeFilter, flagEncoder, graph, inEdgeExplorer, maxVisitedNodes, nodeAccess, outEdgeExplorer, traversalMode, weighting
Constructor and Description |
---|
DijkstraBidirectionRef(Graph graph,
Weighting weighting,
TraversalMode tMode) |
Modifier and Type | Method and Description |
---|---|
protected SPTEntry |
createEntry(EdgeIteratorState edge,
double weight,
SPTEntry parent,
boolean reverse) |
protected SPTEntry |
createStartEntry(int node,
double weight,
boolean reverse) |
String |
getName() |
protected SPTEntry |
getParent(SPTEntry entry) |
accept, bwdSearchCanBeStopped, calcPath, calcWeight, createAndInitPath, extractPath, finished, fromEntryCanBeSkipped, fwdSearchCanBeStopped, getCurrentFromWeight, getCurrentToWeight, getOrigEdgeId, getTraversalId, getVisitedNodes, initCollections, initFrom, initTo, postInit, runAlgo, setUpdateBestPath, toEntryCanBeSkipped, updateBestPath, updateEntry
accept, calcPaths, checkAlreadyRun, createEmptyPath, isMaxVisitedNodesExceeded, setEdgeFilter, setMaxVisitedNodes, toString
public DijkstraBidirectionRef(Graph graph, Weighting weighting, TraversalMode tMode)
protected SPTEntry createStartEntry(int node, double weight, boolean reverse)
createStartEntry
in class AbstractBidirAlgo
protected SPTEntry createEntry(EdgeIteratorState edge, double weight, SPTEntry parent, boolean reverse)
createEntry
in class AbstractBidirAlgo
public String getName()
getName
in interface RoutingAlgorithm
getName
in class AbstractRoutingAlgorithm
Copyright © 2012–2018. All rights reserved.