|
Oracle® Spatial Java API Reference 11g Release 2 (11.2) E11829-02 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object
oracle.spatial.network.lod.DefaultPairwiseShortestPaths
public class DefaultPairwiseShortestPaths
This is the default pairwise shortest paths algorithm. It computes the pairwise shortest paths one by one using the input shortest path algorithm.
Constructor Summary | |
---|---|
DefaultPairwiseShortestPaths(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, ShortestPath spAlgorithm) Consstruct a DefaultPairwiseSP instance. |
Method Summary | |
---|---|
void |
setInitialAnalysisInfo(LODAnalysisInfo analysisInfo) Sets the initial analysis info. |
Matrix<LogicalSubPath> |
shortestPaths(PointOnNet[][] startPoints, PointOnNet[][] endPoints, LODNetworkConstraint constraint) Returns the pair-wise shortest paths between a set of candidate start points and end points. |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public DefaultPairwiseShortestPaths(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, ShortestPath spAlgorithm)
ne
-lccs
-nccs
-spAlgorithm
-Method Detail |
---|
public void setInitialAnalysisInfo(LODAnalysisInfo analysisInfo)
analysisInfo
- analysis informationpublic Matrix<LogicalSubPath> shortestPaths(PointOnNet[][] startPoints, PointOnNet[][] endPoints, LODNetworkConstraint constraint) throws LODNetworkException
startPoints
- array of start candidatesendPoints
- array of end candidatesconstraint
- network constraintLODNetworkException
|
Oracle® Spatial Java API Reference 11g Release 2 (11.2) E11829-02 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |