oracle.spatial.network.lod

Class BidirectionalBfs

java.lang.Object

oracle.spatial.network.lod.BidirectionalBfs

All Implemented Interfaces:

ShortestPath

Direct Known Subclasses:

BidirectionalDijkstra

public class BidirectionalBfs
extends java.lang.Object
implements ShortestPath

Since:

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

Constructor Summary

Constructors

Constructor and Description
BidirectionalBfs(BreadthFirstSearch forwardBfs, BreadthFirstSearch backwardBfs)
BidirectionalBfs(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, LinkLevelSelector forwardLinkLevelSelector, LinkLevelSelector backwardLinkLevelSelector)

Method Summary

Modifier and Type	Method and Description
ShortestPath	clone()
LinkCostCalculator[]	getLinkCostCalculators() Returns the link cost calculators.
LinkLevelSelector	getLinkLevelSelector() Returns the link level selector.
NodeCostCalculator[]	getNodeCostCalculators() Returns the node cost calculators.
void	setInitialAnalysisInfo(LODAnalysisInfo analysisInfo) Sets the initial analysis info.
void	setLinkCostCalculators(LinkCostCalculator[] lccs) Sets the link cost calculators.
void	setLinkLevelSelector(LinkLevelSelector lls) Sets the link level selector.
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.
void	setNodeCostCalculators(NodeCostCalculator[] nccs) Sets the node cost calculators.
LogicalSubPath	shortestPath(PointOnNet[] startPoints, PointOnNet[] endPoints, LODNetworkConstraint constraint, int direction) Returns the shortest path between a set of candidate start points and a set of end points.

Methods inherited from class java.lang.Object

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

Constructor Detail

BidirectionalBfs

public BidirectionalBfs(NetworkExplorer ne,
                        LinkCostCalculator[] lccs,
                        NodeCostCalculator[] nccs,
                        LinkLevelSelector forwardLinkLevelSelector,
                        LinkLevelSelector backwardLinkLevelSelector)

BidirectionalBfs

public BidirectionalBfs(BreadthFirstSearch forwardBfs,
                        BreadthFirstSearch backwardBfs)

Method Detail

shortestPath

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

Description copied from interface: ShortestPath

Returns the shortest path between a set of candidate start points and a set of end points.

Specified by:

shortestPath in interface ShortestPath

Parameters:

startPoints - start candidates

endPoints - end candidates

constraint - network constraint

direction - NetworkExplorer.DIRECTION_FORWARD or NetworkExplorer.DIRECTION_BACKWARD

Returns:

Throws:

LODNetworkException

setInitialAnalysisInfo

public void setInitialAnalysisInfo(LODAnalysisInfo analysisInfo)

Description copied from interface: ShortestPath

Sets the initial analysis info. This method allows analysis info to be passed to subsequent analysis.

Specified by:

setInitialAnalysisInfo in interface ShortestPath

Parameters:

analysisInfo - analysis information

getLinkLevelSelector

public LinkLevelSelector getLinkLevelSelector()

Description copied from interface: ShortestPath

Returns the link level selector.

Specified by:

getLinkLevelSelector in interface ShortestPath

Returns:

setLinkLevelSelector

public void setLinkLevelSelector(LinkLevelSelector lls)

Description copied from interface: ShortestPath

Sets the link level selector.

Specified by:

setLinkLevelSelector in interface ShortestPath

Parameters:

lls - link level selector

getLinkCostCalculators

public LinkCostCalculator[] getLinkCostCalculators()

Description copied from interface: ShortestPath

Returns the link cost calculators.

Specified by:

getLinkCostCalculators in interface ShortestPath

Returns:

setLinkCostCalculators

public void setLinkCostCalculators(LinkCostCalculator[] lccs)

Description copied from interface: ShortestPath

Sets the link cost calculators.

Specified by:

setLinkCostCalculators in interface ShortestPath

getNodeCostCalculators

public NodeCostCalculator[] getNodeCostCalculators()

Description copied from interface: ShortestPath

Returns the node cost calculators.

Specified by:

getNodeCostCalculators in interface ShortestPath

Returns:

setNodeCostCalculators

public void setNodeCostCalculators(NodeCostCalculator[] nccs)

Description copied from interface: ShortestPath

Sets the node cost calculators.

Specified by:

setNodeCostCalculators in interface ShortestPath

setNetworkAnalyst

public void setNetworkAnalyst(NetworkAnalyst analyst)

Description copied from interface: ShortestPath

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.

Specified by:

setNetworkAnalyst in interface ShortestPath

clone

public ShortestPath clone()

Specified by:

clone in interface ShortestPath

Overrides:

clone in class java.lang.Object