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, withinCostPoints
findConnectedFeatures, getLinkCostCalculators, getLinkLevelSelector, getNodeCostCalculators, getXMLSchema, init, initSearch, preparePathFeature, reset, setInitialAnalysisInfo, setLinkCostCalculators, setLinkLevelSelector, setNetworkAnalyst, setNetworkExplorer, setNodeCostCalculators
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
setLinkLevelSelector, setNetworkAnalyst
getLinkCostCalculators, getLinkLevelSelector, getNodeCostCalculators, setInitialAnalysisInfo, setLinkCostCalculators, setLinkLevelSelector, setNetworkAnalyst, setNodeCostCalculators
public 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 ShortestPath
clone
in class BreadthFirstSearch
public LogicalSubPath[] kShortestPaths(PointOnNet[] startPoints, PointOnNet[] endPoints, int topK, LODNetworkConstraint constraint, PathFilter pathFilter, int direction) throws LODNetworkException
KShortestPaths
kShortestPaths
in interface KShortestPaths
startPoints
- candidate start pointsendPoints
- candidate end pointstopK
- max number of paths to be returnedconstraint
- network constraintdirection
- NetworkExplorer.DIRECTION_FORWARD or NetworkExplorer.DIRECTION_BACKWARDLODNetworkException