public class KShortestPathsBfs extends BreadthFirstSearch implements KShortestPaths
| Constructor and Description |
|---|
KShortestPathsBfs() |
KShortestPathsBfs(NetworkExplorer ne,
LinkCostCalculator[] lccs,
NodeCostCalculator[] nccs,
LinkLevelSelector lls,
double maxToMinBound,
long timeout) |
KShortestPathsBfs(NetworkExplorer ne,
LinkCostCalculator[] lccs,
NodeCostCalculator[] nccs,
LinkLevelSelector lls,
PriorityQueue queue,
double maxToMinBound,
long timeout) |
| Modifier and Type | Method and Description |
|---|---|
KShortestPathsBfs |
clone() |
LogicalSubPath[] |
kShortestPaths(PointOnNet[] startPoints,
PointOnNet[] endPoints,
int topK,
LODNetworkConstraint constraint,
PathFilter pathFilter,
int direction)
Returns the k shortest paths from the start point to the end point.
|
nearestFeatures, nearestNeighbors, nearestPoints, networkBuffer, shortestPath, shortestPaths, shortestPathsLight, traceOut, withinCost, withinCostFeatures, withinCostPointsfindConnectedFeatures, getLinkCostCalculators, getLinkLevelSelector, getNodeCostCalculators, getXMLSchema, init, initSearch, preparePathFeature, reset, setInitialAnalysisInfo, setLinkCostCalculators, setLinkLevelSelector, setNetworkAnalyst, setNetworkExplorer, setNodeCostCalculatorsequals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitsetLinkLevelSelector, setNetworkAnalystgetLinkCostCalculators, getLinkLevelSelector, getNodeCostCalculators, setInitialAnalysisInfo, setLinkCostCalculators, setLinkLevelSelector, setNetworkAnalyst, setNodeCostCalculatorspublic KShortestPathsBfs()
public KShortestPathsBfs(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, LinkLevelSelector lls, PriorityQueue queue, double maxToMinBound, long timeout)
public KShortestPathsBfs(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, LinkLevelSelector lls, double maxToMinBound, long timeout)
public KShortestPathsBfs clone()
clone in interface ShortestPathclone in class BreadthFirstSearchpublic LogicalSubPath[] kShortestPaths(PointOnNet[] startPoints, PointOnNet[] endPoints, int topK, LODNetworkConstraint constraint, PathFilter pathFilter, int direction) throws LODNetworkException
KShortestPathskShortestPaths in interface KShortestPathsstartPoints - candidate start pointsendPoints - candidate end pointstopK - max number of paths to be returnedconstraint - network constraintdirection - NetworkExplorer.DIRECTION_FORWARD or NetworkExplorer.DIRECTION_BACKWARDLODNetworkException