public class DijkstraBidirectionCH extends DijkstraBidirectionCHNoSOD
graph, inEdgeExplorer, levelEdgeFilter, nodeAccess, outEdgeExplorerbestBwdEntry, bestFwdEntry, bestWeight, bestWeightMapFrom, bestWeightMapOther, bestWeightMapTo, currFrom, currTo, finishedFrom, finishedTo, from, fromOutEdge, maxVisitedNodes, to, toInEdge, traversalMode, updateBestPath| Constructor and Description |
|---|
DijkstraBidirectionCH(RoutingCHGraph graph) |
| Modifier and Type | Method and Description |
|---|---|
protected boolean |
fromEntryCanBeSkipped() |
String |
getName() |
protected boolean |
toEntryCanBeSkipped() |
createEntry, createStartEntry, getParentaccept, calcWeight, calcWeight, createEmptyPath, extractPath, fillEdgesFromUsingFilter, fillEdgesToUsingFilter, finished, getInEdgeWeight, getOrigEdgeId, getOtherNode, getTraversalId, initCollections, postInitFrom, postInitTo, setPathExtractorSupplier, toString, updateEntrybwdSearchCanBeStopped, calcPath, calcPath, calcPaths, checkAlreadyRun, fwdSearchCanBeStopped, getCurrentFromWeight, getCurrentToWeight, getIncomingEdge, getVisitedNodes, initFrom, initTo, isMaxVisitedNodesExceeded, postInit, runAlgo, setMaxVisitedNodes, setUpdateBestPath, updateBestPathclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitcalcPathcalcPath, calcPaths, getVisitedNodes, setMaxVisitedNodespublic DijkstraBidirectionCH(RoutingCHGraph graph)
protected boolean fromEntryCanBeSkipped()
fromEntryCanBeSkipped in class AbstractBidirAlgoprotected boolean toEntryCanBeSkipped()
toEntryCanBeSkipped in class AbstractBidirAlgopublic String getName()
getName in interface RoutingAlgorithmgetName in class DijkstraBidirectionCHNoSODCopyright © 2012–2021. All rights reserved.