Package oracle.spatial.network.lod

Class KShortestPathsBfs

java.lang.Object

oracle.spatial.network.lod.NetworkSearch

oracle.spatial.network.lod.BreadthFirstSearch

oracle.spatial.network.lod.KShortestPathsBfs

All Implemented Interfaces:

KShortestPaths, ShortestPath

public class KShortestPathsBfs
extends BreadthFirstSearch
implements KShortestPaths

BFS implementation of K-shortest paths search.

Since:

release specific (what release of product did this appear in)

Nested Class Summary

Nested classes/interfaces inherited from class oracle.spatial.network.lod.NetworkSearch

NetworkSearch.MatchedPoint, NetworkSearch.NetworkSearchTree, NetworkSearch.NodeLinkIds, NetworkSearch.PartialLinkElement, NetworkSearch.PointOnNetWithLink, NetworkSearch.SameLinkMatchedPointPair, NetworkSearch.Statistics, NetworkSearch.TmpSearchData

Field Summary

Fields inherited from class oracle.spatial.network.lod.NetworkSearch

analyst, initialAnalysisInfo, initialCapacity, lccs, lls, nccs, ne, queue

Constructor Summary

Constructors

Constructor	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)

Method Summary

Modifier and Type	Method	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.

Methods inherited from class oracle.spatial.network.lod.BreadthFirstSearch

allPathsExpand, allPathsRelax, createSingleLinkSubPath, createSingleLinkSubPaths, getMinSubPath, getPointsWithCommonLink, nearestFeatures, nearestNeighbors, nearestPoints, networkBuffer, removeSameLinkMatchedPoints, shortestPath, shortestPaths, shortestPathsLight, traceOut, withinCost, withinCostFeatures, withinCostNodesAndBoundaryPoints, withinCostPoints

Methods inherited from class oracle.spatial.network.lod.NetworkSearch

buildNodeToEndPointsMap, computeNextElementCost, copy, createInitialElement, createNextElement, expand, findConnectedComponentsInPartition, findConnectedFeatures, findConnectedNodes, findConnectedNodes, getAdjacentNodes, getCurrentLink, getElementPartition, getExpandedNode, getFeatureLayerIds, getLinkCostCalculators, getLinkLevelSelector, getMatchedEndPoints, getNextLinks, getNextNode, getNextNodeToExpand, getNodeCostCalculators, getUserDataCategories, getXMLSchema, init, initialize, initSearch, isConstraintSatisfied, logExpandedNode, pointArrayToString, preparePathFeature, relax, removeMatchedEndPoints, reset, setAnalysisInfoForCurrNode, setAnalysisInfoForNextNode, setCurrentAnalysisInfo, setCurrLinkNodeAnalysisInfo, setInitialAnalysisInfo, setLinkCostCalculators, setLinkLevelSelector, setNetworkAnalyst, setNetworkExplorer, setNodeCostCalculators

Methods inherited from class java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface oracle.spatial.network.lod.KShortestPaths

setLinkLevelSelector, setNetworkAnalyst

Methods inherited from interface oracle.spatial.network.lod.ShortestPath

getLinkCostCalculators, getLinkLevelSelector, getNodeCostCalculators, setInitialAnalysisInfo, setLinkCostCalculators, setLinkLevelSelector, setNetworkAnalyst, setNodeCostCalculators

Constructor Detail

KShortestPathsBfs

public KShortestPathsBfs()

KShortestPathsBfs

public KShortestPathsBfs(NetworkExplorer ne,
                         LinkCostCalculator[] lccs,
                         NodeCostCalculator[] nccs,
                         LinkLevelSelector lls,
                         PriorityQueue queue,
                         double maxToMinBound,
                         long timeout)

KShortestPathsBfs

public KShortestPathsBfs(NetworkExplorer ne,
                         LinkCostCalculator[] lccs,
                         NodeCostCalculator[] nccs,
                         LinkLevelSelector lls,
                         double maxToMinBound,
                         long timeout)

Method Detail

clone

public KShortestPathsBfs clone()

Specified by:

clone in interface ShortestPath

Overrides:

clone in class BreadthFirstSearch

kShortestPaths

public LogicalSubPath[] kShortestPaths(PointOnNet[] startPoints,
                                       PointOnNet[] endPoints,
                                       int topK,
                                       LODNetworkConstraint constraint,
                                       PathFilter pathFilter,
                                       int direction)
                                throws LODNetworkException

Description copied from interface: KShortestPaths

Returns the k shortest paths from the start point to the end point.

Specified by:

kShortestPaths in interface KShortestPaths

Parameters:

startPoints - candidate start points

endPoints - candidate end points

topK - max number of paths to be returned

constraint - network constraint

direction - NetworkExplorer.DIRECTION_FORWARD or NetworkExplorer.DIRECTION_BACKWARD

Returns:

Throws:

LODNetworkException