oracle.spatial.network.lod

Class NetworkSearch

java.lang.Object

oracle.spatial.network.lod.NetworkSearch

Direct Known Subclasses:

AStar, BreadthFirstSearch, Dijkstra

public class NetworkSearch
extends java.lang.Object

Since:

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

Constructor Summary

Constructors

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

Method Summary

Methods

Modifier and Type	Method and Description
Feature[]	findConnectedFeatures(PointOnNet[] startPoints, int[] featureLayers, LODNetworkConstraint constraint, FeatureFilter featureFilter, int direction) Returns the features within the given cost and the paths to/from them.
LinkCostCalculator[]	getLinkCostCalculators()
LinkLevelSelector	getLinkLevelSelector()
NodeCostCalculator[]	getNodeCostCalculators()
java.lang.String	getXMLSchema()
void	init(org.w3c.dom.Element parameter)
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)
NetworkBuffer	networkBuffer(PointOnNet[] startPoints, double cost, int direction, LODNetworkConstraint constraint) Returns network buffer within the specified cost.
static PathFeature	preparePathFeature(LogicalSubPath subPath, long pathId)
void	reset()
void	setInitialAnalysisInfo(LODAnalysisInfo analysisInfo)
void	setLinkCostCalculators(LinkCostCalculator[] lccs)
void	setLinkLevelSelector(LinkLevelSelector lls)
void	setNetworkAnalyst(NetworkAnalyst analyst)
void	setNetworkExplorer(NetworkExplorer ne)
void	setNodeCostCalculators(NodeCostCalculator[] nccs)
LogicalSubPath	shortestPath(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.

Methods inherited from class java.lang.Object

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

Constructor Detail

NetworkSearch

public NetworkSearch()

NetworkSearch

public NetworkSearch(NetworkExplorer ne,
             LinkCostCalculator[] lccs,
             NodeCostCalculator[] nccs,
             LinkLevelSelector lls,
             IdentifiablePriorityQueue queue)

Method Detail

init

public void init(org.w3c.dom.Element parameter)

getXMLSchema

public java.lang.String getXMLSchema()

setNetworkExplorer

public void setNetworkExplorer(NetworkExplorer ne)

setInitialAnalysisInfo

public void setInitialAnalysisInfo(LODAnalysisInfo analysisInfo)

getLinkLevelSelector

public LinkLevelSelector getLinkLevelSelector()

setLinkLevelSelector

public void setLinkLevelSelector(LinkLevelSelector lls)

getLinkCostCalculators

public LinkCostCalculator[] getLinkCostCalculators()

setLinkCostCalculators

public void setLinkCostCalculators(LinkCostCalculator[] lccs)

getNodeCostCalculators

public NodeCostCalculator[] getNodeCostCalculators()

setNodeCostCalculators

public void setNodeCostCalculators(NodeCostCalculator[] nccs)

nearestNeighbors

public LogicalLightSubPath[] nearestNeighbors(PointOnNet[] startPoints,
                                     int numberOfNeighbors,
                                     int direction,
                                     LODNetworkConstraint constraint,
                                     LODGoalNode goalNode,
                                     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

preparePathFeature

public static PathFeature preparePathFeature(LogicalSubPath subPath,
                             long pathId)
                                      throws LODNetworkException

Throws:

LODNetworkException

setNetworkAnalyst

public void setNetworkAnalyst(NetworkAnalyst analyst)

reset

public void reset()

shortestPath

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

Throws:

LODNetworkException

findConnectedFeatures

public Feature[] findConnectedFeatures(PointOnNet[] startPoints,
                              int[] featureLayers,
                              LODNetworkConstraint constraint,
                              FeatureFilter featureFilter,
                              int direction)
                                throws LODNetworkException

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

Parameters:

startPoints -

featureLayers -

direction -

constraint -

featureFilter -

Returns:

Throws:

LODNetworkException