public static class AlternativeRoute.AlternativeBidirSearch extends AStarBidirection
bestPath, bestWeightMapFrom, bestWeightMapOther, bestWeightMapTo, currFrom, currTo, finishedFrom, finishedToadditionalEdgeFilter, flagEncoder, graph, inEdgeExplorer, maxVisitedNodes, nodeAccess, outEdgeExplorer, traversalMode, weighting| Constructor and Description |
|---|
AlternativeBidirSearch(Graph graph,
Weighting weighting,
TraversalMode tMode,
double explorationFactor) |
| Modifier and Type | Method and Description |
|---|---|
List<AlternativeRoute.AlternativeInfo> |
calcAlternatives(int maxPaths,
double maxWeightFactor,
double weightInfluence,
double maxShareFactor,
double shareInfluence,
double minPlateauFactor,
double plateauInfluence) |
boolean |
finished()
To be overwritten from extending class.
|
Path |
searchBest(int from,
int to) |
afterHeuristicChange, calcWeight, createEntry, createStartEntry, getApproximation, getName, setApproximation, updateEntryaccept, bwdSearchCanBeStopped, calcPath, createAndInitPath, extractPath, fromEntryCanBeSkipped, fwdSearchCanBeStopped, getCurrentFromWeight, getCurrentToWeight, getOrigEdgeId, getTraversalId, getVisitedNodes, initCollections, initFrom, initTo, postInit, runAlgo, setUpdateBestPath, toEntryCanBeSkipped, updateBestPathaccept, calcPaths, checkAlreadyRun, createEmptyPath, isMaxVisitedNodesExceeded, setEdgeFilter, setMaxVisitedNodes, toStringclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitgetVisitedNodespublic AlternativeBidirSearch(Graph graph, Weighting weighting, TraversalMode tMode, double explorationFactor)
public boolean finished()
AbstractRoutingAlgorithmfinished in class AbstractBidirAlgopublic Path searchBest(int from, int to)
public List<AlternativeRoute.AlternativeInfo> calcAlternatives(int maxPaths, double maxWeightFactor, double weightInfluence, double maxShareFactor, double shareInfluence, double minPlateauFactor, double plateauInfluence)
Copyright © 2012–2018. All rights reserved.