public interface PairwiseShortestPaths
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.
|
void setInitialAnalysisInfo(LODAnalysisInfo analysisInfo)
analysisInfo
- analysis informationMatrix<LogicalSubPath> shortestPaths(PointOnNet[][] startPoints, PointOnNet[][] endPoints, LODNetworkConstraint constraint, Matrix<java.lang.Integer> pairwiseMatrix) throws LODNetworkException
startPoints
- array of start candidatesendPoints
- array of end candidatesconstraint
- network constraintpairwiseMatrix
- 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.LODNetworkException
void setNetworkAnalyst(NetworkAnalyst analyst)