Package oracle.spatial.network.lod

Interface SingleSourceShortestPaths

All Known Implementing Classes:

DefaultSingleSourceShortestPaths, Dijkstra

public interface SingleSourceShortestPaths

Since:

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

Method Summary

Modifier and Type	Method	Description
SingleSourceShortestPaths	clone()
void	setNetworkAnalyst(NetworkAnalyst analyst)	This method allows caller to pass the network analyst object to this shortest path algorithm 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.
LogicalSubPath[]	shortestPaths(PointOnNet[] startPoint, PointOnNet[][] endPoints, LODNetworkConstraint constraint, int direction)	Returns the shortest paths from the start point (one of the start point candidates) to each set of end points (one of the end point candidates).
LogicalLightSubPath[]	shortestPathsLight(PointOnNet[] startPoint, PointOnNet[][] endPoints, LODNetworkConstraint constraint, int direction)	Returns the light weight shortest paths from the start point (one of the start point candidates) to each set of end points (one of the end point candidates).

Method Detail

shortestPathsLight

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

Returns the light weight shortest paths from the start point (one of the start point candidates) to each set of end points (one of the end point candidates).

Parameters:

startPoint - start point candidates

endPoints - array of end point candidates

constraint - network constraint

direction - NetworkExplorer.DIRECTION_FORWARD or NetworkExplorer.DIRECTION_BACKWARD

Returns:

Throws:

LODNetworkException

shortestPaths

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

Returns the shortest paths from the start point (one of the start point candidates) to each set of end points (one of the end point candidates).

Parameters:

startPoint - start point candidates

endPoints - array of end point candidates

constraint - network constraint

direction - NetworkExplorer.DIRECTION_FORWARD or NetworkExplorer.DIRECTION_BACKWARD

Returns:

Throws:

LODNetworkException

setNetworkAnalyst

void setNetworkAnalyst(NetworkAnalyst analyst)

This method allows caller to pass the network analyst object to this shortest path algorithm 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 shortest path algorithm, the algorithm can choose to do nothing with this method.

clone

SingleSourceShortestPaths clone()