public class DijkstraBidirectionCH extends DijkstraBidirectionCHNoSOD
allEdgeExplorer, graph, inEdgeExplorer, levelEdgeFilter, outEdgeExplorer
bestBwdEntry, bestFwdEntry, bestWeight, bestWeightMapFrom, bestWeightMapOther, bestWeightMapTo, currFrom, currTo, finishedFrom, finishedTo, from, fromOutEdge, maxVisitedNodes, nodeAccess, 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, getParent
accept, accept, calcWeight, calcWeight, createEmptyPath, createPathExtractor, extractPath, fillEdgesFromUsingFilter, fillEdgesToUsingFilter, finished, getInEdgeWeight, getOrigEdgeId, getOtherNode, getTraversalId, getTraversalId, initCollections, postInitFrom, postInitTo, toString, updateEntry
bwdSearchCanBeStopped, calcPath, calcPath, calcPaths, checkAlreadyRun, fwdSearchCanBeStopped, getCurrentFromWeight, getCurrentToWeight, getIncomingEdge, getVisitedNodes, initFrom, initTo, isMaxVisitedNodesExceeded, postInit, runAlgo, setMaxVisitedNodes, setUpdateBestPath, updateBestPath
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
calcPath
calcPath, calcPaths, getVisitedNodes, setMaxVisitedNodes
public DijkstraBidirectionCH(RoutingCHGraph graph)
protected boolean fromEntryCanBeSkipped()
fromEntryCanBeSkipped
in class AbstractBidirAlgo
protected boolean toEntryCanBeSkipped()
toEntryCanBeSkipped
in class AbstractBidirAlgo
public String getName()
getName
in interface RoutingAlgorithm
getName
in class DijkstraBidirectionCHNoSOD
Copyright © 2012–2020. All rights reserved.