public static class AlternativeRoute.AlternativeBidirSearch extends AStarBidirection
bestPath, bestWeightMapFrom, bestWeightMapTo, currFrom, currTofinishedFrom, finishedToflagEncoder, 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.
|
com.carrotsearch.hppc.IntObjectMap<AStar.AStarEntry> |
getBestWeightMapFrom() |
com.carrotsearch.hppc.IntObjectMap<AStar.AStarEntry> |
getBestWeightMapTo() |
Path |
searchBest(int to,
int from) |
afterHeuristicChange, createAndInitPath, createSPTEntry, extractPath, getApproximation, getCurrentFromWeight, getCurrentToWeight, getName, initCollections, initFrom, initTo, setApproximation, updateBestPathcalcPath, getVisitedNodes, runAlgoaccept, calcPaths, checkAlreadyRun, createEmptyPath, isMaxVisitedNodesExceeded, setEdgeFilter, setMaxVisitedNodes, toString, updateBestPathclone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, waitgetVisitedNodespublic AlternativeBidirSearch(Graph graph, Weighting weighting, TraversalMode tMode, double explorationFactor)
public com.carrotsearch.hppc.IntObjectMap<AStar.AStarEntry> getBestWeightMapFrom()
public com.carrotsearch.hppc.IntObjectMap<AStar.AStarEntry> getBestWeightMapTo()
public boolean finished()
AbstractRoutingAlgorithmfinished in class AStarBidirectionpublic Path searchBest(int to, int from)
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.