oracle.spatial.network.lod

Interface PairwiseShortestPaths

All Known Implementing Classes:

DefaultPairwiseShortestPaths

public interface PairwiseShortestPaths

A PairwiseShortestPaths is an algorithm to calculate the the pair-wise shortest paths between a set of candidate start points and end points.

Since:

Oracle Database 11g Release 2 (11.2)

Method Summary

Methods

Modifier and Type	Method and Description
void	setInitialAnalysisInfo(LODAnalysisInfo analysisInfo) Sets the initial analysis info.
void	setNetworkAnalyst(NetworkAnalyst analyst) This method allows caller to pass the network analyst object to this pairwise shortest paths implementation, so that the algorithm can call the analysis functions provided by the network analyst, or access the network explorer associated with the network analyst.
Matrix<LogicalSubPath>	shortestPaths(PointOnNet[][] startPoints, PointOnNet[][] endPoints, LODNetworkConstraint constraint, Matrix<java.lang.Integer> pairwiseMatrix) Returns the pair-wise shortest paths between a set of candidate start points and end points.

Method Detail

setInitialAnalysisInfo

void setInitialAnalysisInfo(LODAnalysisInfo analysisInfo)

Sets the initial analysis info. This method allows analysis info to be passed to subsequent analysis.

Parameters:

analysisInfo - analysis information

shortestPaths

Matrix<LogicalSubPath> shortestPaths(PointOnNet[][] startPoints,
                                   PointOnNet[][] endPoints,
                                   LODNetworkConstraint constraint,
                                   Matrix<java.lang.Integer> pairwiseMatrix)
                                     throws LODNetworkException

Returns the pair-wise shortest paths between a set of candidate start points and end points.

Parameters:

startPoints - array of start candidates

endPoints - array of end candidates

constraint - network constraint

pairwiseMatrix - a matrix that specifies for which pairs the shortest paths need to be computed. If the matrix element for pair (i, j) is set to 0, then the shortest path from i to j does not need to be computed; otherwise it must be computed. If this parameter is set to null, then the shortest paths for all pairs must be computed.

Returns:

Throws:

LODNetworkException

setNetworkAnalyst

void setNetworkAnalyst(NetworkAnalyst analyst)

This method allows caller to pass the network analyst object to this pairwise shortest paths implementation, so that the algorithm can call the analysis functions provided by the network analyst, or access the network explorer associated with the network analyst. If network analyst is not needed by the algorithm, the algorithm can choose to do nothing with this method.