|
Oracle® Spatial Java API Reference 11g Release 1 (11.1) B28401-02 |
||||||||
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(oracle.spatial.network.lod.NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, ShortestPath spAlgorithm) |
Method Summary | |
---|---|
LogicalPath[] |
kShortestPaths(long startNodeId, long endNodeId, 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(oracle.spatial.network.lod.NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, ShortestPath spAlgorithm)
Method Detail |
---|
public void setLinkLevelSelector(LinkLevelSelector lls)
KShortestPaths
setLinkLevelSelector
in interface KShortestPaths
lls
- link level selectorpublic LogicalPath[] kShortestPaths(long startNodeId, long endNodeId, int k, LODNetworkConstraint constraint) throws LODNetworkException
KShortestPaths
kShortestPaths
in interface KShortestPaths
startNodeId
-endNodeId
-k
-constraint
-LODNetworkException
|
Oracle® Spatial Java API Reference 11g Release 1 (11.1) B28401-02 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |