oracle.spatial.network.lod

Interface KShortestPaths

All Known Implementing Classes:

YenDeviation

public interface KShortestPaths

This interface defines methods supported by a k shortest path algorithm.

Since:

11gR2

Method Summary

Modifier and Type	Method and Description
LogicalSubPath[]	kShortestPaths(PointOnNet[] startPoint, PointOnNet[] endPoint, int k, LODNetworkConstraint constraint, int direction) Returns the k shortest paths from the start point to the end point.
void	setLinkLevelSelector(LinkLevelSelector lls) Sets link level selector.
void	setNetworkAnalyst(NetworkAnalyst analyst) This method allows caller to pass the network analyst object to this k shortest paths 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.

Method Detail

kShortestPaths

LogicalSubPath[] kShortestPaths(PointOnNet[] startPoint,
                                PointOnNet[] endPoint,
                                int k,
                                LODNetworkConstraint constraint,
                                int direction)
                         throws LODNetworkException

Returns the k shortest paths from the start point to the end point.

Parameters:

startPoint - candidate start points

endPoint - candidate end points

k - max number of paths to be returned

constraint - network constraint

direction - NetworkExplorer.DIRECTION_FORWARD or NetworkExplorer.DIRECTION_BACKWARD

Returns:

Throws:

LODNetworkException

setLinkLevelSelector

void setLinkLevelSelector(LinkLevelSelector lls)

Sets link level selector.

Parameters:

lls - link level selector

setNetworkAnalyst

void setNetworkAnalyst(NetworkAnalyst analyst)

This method allows caller to pass the network analyst object to this k shortest paths 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.