oracle.spatial.network.lod

Class BreadthFirstSearch

java.lang.Object

oracle.spatial.network.lod.NetworkSearch

oracle.spatial.network.lod.BreadthFirstSearch

All Implemented Interfaces:

ShortestPath

Direct Known Subclasses:

AStar, Dijkstra, KShortestPathsBfs

public class BreadthFirstSearch
extends NetworkSearch
implements ShortestPath

Network search algorithm that explores the network in breadth first manner.

Since:

Oracle Database 11g Release 1 (11.1)

Constructor Summary

Constructors

Constructor and Description
BreadthFirstSearch()
BreadthFirstSearch(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, LinkLevelSelector lls)
BreadthFirstSearch(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, LinkLevelSelector lls, PriorityQueue queue)

Method Summary

Modifier and Type	Method and Description
BreadthFirstSearch	clone()
FeaturePath[]	nearestFeatures(PointOnNet[] startPoints, int numberOfFeatures, int[] featureLayers, LODNetworkConstraint constraint, FeatureFilter featureFilter, int direction)
LogicalLightSubPath[]	nearestNeighbors(PointOnNet[] startPoints, int numberOfNeighbors, int direction, LODNetworkConstraint constraint, LODGoalNode goalNode, boolean returnFullPath)
PathToPoint[]	nearestPoints(PointOnNet[] startPoint, PointOnNet[][] endPoints, int k, LODNetworkConstraint constraint, int direction, boolean returnFullPath)
NetworkBuffer	networkBuffer(PointOnNet[] startPoints, double cost, int direction, LODNetworkConstraint constraint) Returns network buffer within the specified cost.
LogicalSubPath	shortestPath(PointOnNet[] startPoints, PointOnNet[] endPoints, LODNetworkConstraint constraint, int direction) Returns the shortest path between a set of candidate start points and a set of end points.
LogicalSubPath[]	shortestPaths(PointOnNet[] startPoints, PointOnNet[][] endPoints, LODNetworkConstraint constraint, int direction)
LogicalLightSubPath[]	shortestPathsLight(PointOnNet[] startPoints, PointOnNet[][] endPoints, LODNetworkConstraint constraint, int direction)
LogicalLightSubPath[]	traceOut(PointOnNet[] startPoints, double cost, int direction, LODNetworkConstraint constraint, LODGoalNode goalNode, boolean returnFullPath, boolean returnBoundaryPointsOnly)
LogicalLightSubPath[]	withinCost(PointOnNet[] startPoints, double cost, int direction, LODNetworkConstraint constraint, LODGoalNode goalNode, boolean returnFullPath, boolean returnBoundaryPointsOnly)
FeaturePath[]	withinCostFeatures(PointOnNet[] startPoints, double cost, int[] featureLayers, LODNetworkConstraint constraint, FeatureFilter featureFilter, int direction) Returns the features and the paths to/from them within the given cost.
PathToPoint[]	withinCostPoints(PointOnNet[] startPoint, PointOnNet[][] endPoints, double maxCost, LODNetworkConstraint constraint, int direction, boolean returnFullPath)

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

findConnectedFeatures, getLinkCostCalculators, getLinkLevelSelector, getNodeCostCalculators, getXMLSchema, init, initSearch, preparePathFeature, reset, setInitialAnalysisInfo, setLinkCostCalculators, setLinkLevelSelector, setNetworkAnalyst, setNetworkExplorer, setNodeCostCalculators

Methods inherited from class java.lang.Object

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

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

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

Constructor Detail

BreadthFirstSearch

public BreadthFirstSearch()

BreadthFirstSearch

public BreadthFirstSearch(NetworkExplorer ne,
                          LinkCostCalculator[] lccs,
                          NodeCostCalculator[] nccs,
                          LinkLevelSelector lls,
                          PriorityQueue queue)

BreadthFirstSearch

public BreadthFirstSearch(NetworkExplorer ne,
                          LinkCostCalculator[] lccs,
                          NodeCostCalculator[] nccs,
                          LinkLevelSelector lls)

Method Detail

clone

public BreadthFirstSearch clone()

Specified by:

clone in interface ShortestPath

Overrides:

clone in class java.lang.Object

nearestNeighbors

public LogicalLightSubPath[] nearestNeighbors(PointOnNet[] startPoints,
                                              int numberOfNeighbors,
                                              int direction,
                                              LODNetworkConstraint constraint,
                                              LODGoalNode goalNode,
                                              boolean returnFullPath)
                                       throws LODNetworkException

Throws:

LODNetworkException

nearestPoints

public PathToPoint[] nearestPoints(PointOnNet[] startPoint,
                                   PointOnNet[][] endPoints,
                                   int k,
                                   LODNetworkConstraint constraint,
                                   int direction,
                                   boolean returnFullPath)
                            throws LODNetworkException

Throws:

LODNetworkException

withinCostPoints

public PathToPoint[] withinCostPoints(PointOnNet[] startPoint,
                                      PointOnNet[][] endPoints,
                                      double maxCost,
                                      LODNetworkConstraint constraint,
                                      int direction,
                                      boolean returnFullPath)
                               throws LODNetworkException

Throws:

LODNetworkException

withinCost

public LogicalLightSubPath[] withinCost(PointOnNet[] startPoints,
                                        double cost,
                                        int direction,
                                        LODNetworkConstraint constraint,
                                        LODGoalNode goalNode,
                                        boolean returnFullPath,
                                        boolean returnBoundaryPointsOnly)
                                 throws LODNetworkException

Throws:

LODNetworkException

traceOut

public LogicalLightSubPath[] traceOut(PointOnNet[] startPoints,
                                      double cost,
                                      int direction,
                                      LODNetworkConstraint constraint,
                                      LODGoalNode goalNode,
                                      boolean returnFullPath,
                                      boolean returnBoundaryPointsOnly)
                               throws LODNetworkException

Throws:

LODNetworkException

networkBuffer

public NetworkBuffer networkBuffer(PointOnNet[] startPoints,
                                   double cost,
                                   int direction,
                                   LODNetworkConstraint constraint)
                            throws LODNetworkException

Returns network buffer within the specified cost.

Parameters:

startPoints -

cost -

direction -

constraint -

Returns:

Throws:

LODNetworkException

nearestFeatures

public FeaturePath[] nearestFeatures(PointOnNet[] startPoints,
                                     int numberOfFeatures,
                                     int[] featureLayers,
                                     LODNetworkConstraint constraint,
                                     FeatureFilter featureFilter,
                                     int direction)
                              throws LODNetworkException

Throws:

LODNetworkException

withinCostFeatures

public FeaturePath[] withinCostFeatures(PointOnNet[] startPoints,
                                        double cost,
                                        int[] featureLayers,
                                        LODNetworkConstraint constraint,
                                        FeatureFilter featureFilter,
                                        int direction)
                                 throws LODNetworkException

Returns the features and the paths to/from them within the given cost.

Parameters:

startPoints -

cost -

direction -

constraint -

featureFilter -

Returns:

Throws:

LODNetworkException

shortestPath

public LogicalSubPath shortestPath(PointOnNet[] startPoints,
                                   PointOnNet[] endPoints,
                                   LODNetworkConstraint constraint,
                                   int direction)
                            throws LODNetworkException

Description copied from interface: ShortestPath

Returns the shortest path between a set of candidate start points and a set of end points.

Specified by:

shortestPath in interface ShortestPath

Parameters:

startPoints - start candidates

endPoints - end candidates

constraint - network constraint

direction - NetworkExplorer.DIRECTION_FORWARD or NetworkExplorer.DIRECTION_BACKWARD

Returns:

Throws:

LODNetworkException

shortestPaths

public LogicalSubPath[] shortestPaths(PointOnNet[] startPoints,
                                      PointOnNet[][] endPoints,
                                      LODNetworkConstraint constraint,
                                      int direction)
                               throws LODNetworkException

Throws:

LODNetworkException

shortestPathsLight

public LogicalLightSubPath[] shortestPathsLight(PointOnNet[] startPoints,
                                                PointOnNet[][] endPoints,
                                                LODNetworkConstraint constraint,
                                                int direction)
                                         throws LODNetworkException

Throws:

LODNetworkException