|
Oracle® Spatial Java API Reference 11g Release 2 (11.2) E11829-01 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object
oracle.spatial.network.lod.YenDeviation
public class YenDeviation
This class implements Yen's Deviation Algorithm for finding the k shortest loopless paths. Reference: J.Y.Yen. Finding the k shortest loopless paths in a network. Management Science 17:712-716, 1971.
Constructor Summary | |
---|---|
YenDeviation(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, ShortestPath spAlgorithm) |
Method Summary | |
---|---|
LogicalSubPath[] |
kShortestPaths(PointOnNet[] startPoints, PointOnNet[] endPoints, int k, LODNetworkConstraint constraint) Returns the k-shortest paths from the start point to the end point. |
void |
setLinkLevelSelector(LinkLevelSelector lls) Sets link level selector. |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public YenDeviation(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, ShortestPath spAlgorithm)
Method Detail |
---|
public void setLinkLevelSelector(LinkLevelSelector lls)
KShortestPaths
setLinkLevelSelector
in interface KShortestPaths
lls
- link level selectorpublic LogicalSubPath[] kShortestPaths(PointOnNet[] startPoints, PointOnNet[] endPoints, int k, LODNetworkConstraint constraint) throws LODNetworkException
KShortestPaths
kShortestPaths
in interface KShortestPaths
startPoints
- candidate start pointsendPoints
- dandidate end pointsk
- max number of paths to be returnedconstraint
- network constraintLODNetworkException
|
Oracle® Spatial Java API Reference 11g Release 2 (11.2) E11829-01 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |