public class DebugDijkstraBidirection extends DijkstraBidirectionRef implements DebugAlgo
additionalEdgeFilter, edgeExplorer, graph, nodeAccess, weightingbestBwdEntry, bestFwdEntry, bestWeight, bestWeightMapFrom, bestWeightMapOther, bestWeightMapTo, currFrom, currTo, finishedFrom, finishedTo, from, fromOutEdge, maxVisitedNodes, to, toInEdge, traversalMode, updateBestPath| Constructor and Description |
|---|
DebugDijkstraBidirection(Graph graph,
Weighting type,
TraversalMode tMode,
GraphicsWrapper mg) |
| Modifier and Type | Method and Description |
|---|---|
void |
setGraphics2D(Graphics2D g2) |
void |
updateBestPath(double edgeWeight,
SPTEntry entry,
int origEdgeId,
int traversalId,
boolean reverse) |
createEntry, createStartEntry, getName, getParentaccept, calcWeight, createEmptyPath, createPathExtractor, extractPath, fillEdgesFromUsingFilter, fillEdgesToUsingFilter, getInEdgeWeight, postInitFrom, postInitTo, toStringbwdSearchCanBeStopped, calcPath, calcPath, calcPaths, checkAlreadyRun, finished, fromEntryCanBeSkipped, fwdSearchCanBeStopped, getCurrentFromWeight, getCurrentToWeight, getIncomingEdge, getVisitedNodes, initCollections, initFrom, initTo, isMaxVisitedNodesExceeded, postInit, runAlgo, setMaxVisitedNodes, setUpdateBestPath, toEntryCanBeSkippedclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitcalcPathcalcPath, calcPaths, getVisitedNodes, setMaxVisitedNodespublic DebugDijkstraBidirection(Graph graph, Weighting type, TraversalMode tMode, GraphicsWrapper mg)
public void setGraphics2D(Graphics2D g2)
setGraphics2D in interface DebugAlgopublic void updateBestPath(double edgeWeight,
SPTEntry entry,
int origEdgeId,
int traversalId,
boolean reverse)
updateBestPath in class AbstractBidirAlgoCopyright © 2012–2022. All rights reserved.