Skip navigation links

oracle.spatial.network.lod
Class Dijkstra

java.lang.Object
oracle.spatial.network.lod.Dijkstra

All Implemented Interfaces:

ShortestPath

public class Dijkstra

extends java.lang.Object

implements ShortestPath

This class implements Dijkstra shortest path algorithm.

Since:

11gR1

Constructor Summary

Dijkstra(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, LinkLevelSelector lls)

Method Summary

LinkCostCalculator[]	getLinkCostCalculators()
LinkLevelSelector	getLinkLevelSelector()
NodeCostCalculator[]	getNodeCostCalculators()
LogicalLightSubPath[]	nearestNeighbors(PointOnNet[] startPoints, int numberOfNeighbors, int direction, LODNetworkConstraint constraint, LODGoalNode goalNode, boolean returnFullPath)
NetworkBuffer	networkBuffer(PointOnNet[] startPoints, double cost, int direction, LODNetworkConstraint constraint) Returns network buffer within the specified cost.
void	setInitialAnalysisInfo(LODAnalysisInfo analysisInfo)
void	setLinkCostCalculators(LinkCostCalculator[] lccs)
void	setLinkLevelSelector(LinkLevelSelector lls)
void	setNodeCostCalculators(NodeCostCalculator[] nccs)
LogicalSubPath	shortestPath(PointOnNet[] startPoints, PointOnNet[] endPoints, LODNetworkConstraint constraint)
LogicalLightSubPath[]	traceOut(PointOnNet[] startPoints, double cost, int direction, LODNetworkConstraint constraint, LODGoalNode goalNode, boolean returnFullPath, boolean returnBoundaryPointsOnly)
LogicalLightSubPath[]	withinCost(PointOnNet[] startPoints, double cost, int direction, LODNetworkConstraint constraint, LODGoalNode goalNode, boolean returnFullPath, boolean returnBoundaryPointsOnly)

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface oracle.spatial.network.lod.ShortestPath

getLinkCostCalculators, getLinkLevelSelector, getNodeCostCalculators, setInitialAnalysisInfo, setLinkCostCalculators, setLinkLevelSelector, setNodeCostCalculators, shortestPath

Constructor Detail

Dijkstra

public Dijkstra(NetworkExplorer ne,
                LinkCostCalculator[] lccs,
                NodeCostCalculator[] nccs,
                LinkLevelSelector lls)

Method Detail

nearestNeighbors

public LogicalLightSubPath[] nearestNeighbors(PointOnNet[] startPoints,
                                              int numberOfNeighbors,
                                              int direction,
                                              LODNetworkConstraint constraint,
                                              LODGoalNode goalNode,
                                              boolean returnFullPath)
                                       throws LODNetworkException

Throws:

LODNetworkException

withinCost

public LogicalLightSubPath[] withinCost(PointOnNet[] startPoints,
                                        double cost,
                                        int direction,
                                        LODNetworkConstraint constraint,
                                        LODGoalNode goalNode,
                                        boolean returnFullPath,
                                        boolean returnBoundaryPointsOnly)
                                 throws LODNetworkException

Throws:

LODNetworkException

traceOut

public LogicalLightSubPath[] traceOut(PointOnNet[] startPoints,
                                      double cost,
                                      int direction,
                                      LODNetworkConstraint constraint,
                                      LODGoalNode goalNode,
                                      boolean returnFullPath,
                                      boolean returnBoundaryPointsOnly)
                               throws LODNetworkException

Throws:

LODNetworkException

networkBuffer

public NetworkBuffer networkBuffer(PointOnNet[] startPoints,
                                   double cost,
                                   int direction,
                                   LODNetworkConstraint constraint)
                            throws LODNetworkException

Returns network buffer within the specified cost.

Parameters:

startPoints -

cost -

direction -

constraint -

Returns:

Throws:

LODNetworkException

setInitialAnalysisInfo

public void setInitialAnalysisInfo(LODAnalysisInfo analysisInfo)

getLinkLevelSelector

public LinkLevelSelector getLinkLevelSelector()

setLinkLevelSelector

public void setLinkLevelSelector(LinkLevelSelector lls)

getLinkCostCalculators

public LinkCostCalculator[] getLinkCostCalculators()

setLinkCostCalculators

public void setLinkCostCalculators(LinkCostCalculator[] lccs)

getNodeCostCalculators

public NodeCostCalculator[] getNodeCostCalculators()

setNodeCostCalculators

public void setNodeCostCalculators(NodeCostCalculator[] nccs)

shortestPath

public LogicalSubPath shortestPath(PointOnNet[] startPoints,
                                   PointOnNet[] endPoints,
                                   LODNetworkConstraint constraint)
                            throws LODNetworkException

Throws:

LODNetworkException

Skip navigation links