Package oracle.spatial.network.lod

Class NetworkSearch.NetworkSearchTree

java.lang.Object

oracle.spatial.network.lod.NetworkSearch.NetworkSearchTree

Enclosing class:

NetworkSearch

protected static class NetworkSearch.NetworkSearchTree
extends java.lang.Object

Constructor Summary

Constructors

Constructor	Description
NetworkSearchTree(LongHashMap<HeavyPointOnNet> roots, int direction)

Method Summary

Modifier and Type	Method	Description
void	addNode(VisitedNode node)
boolean	contains(long nodeId)
int	getDirection()
VisitedNode	getNode(long nodeId)
long[]	getOrderedNodeIds()	Returns the node IDs in increasing depth order.
LogicalSubPath	getSubPathFromRoot(long nodeId, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, NetworkExplorer ne)
boolean	isRoot(long nodeId)
java.util.Iterator<VisitedNode>	nodeIterator()
void	removeNode(long nodeId)

Methods inherited from class java.lang.Object

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

Constructor Detail

NetworkSearchTree

public NetworkSearchTree(LongHashMap<HeavyPointOnNet> roots,
                         int direction)

Method Detail

getDirection

public int getDirection()

addNode

public void addNode(VisitedNode node)

contains

public boolean contains(long nodeId)

getOrderedNodeIds

public long[] getOrderedNodeIds()

Returns the node IDs in increasing depth order.

Returns:

nodeIterator

public java.util.Iterator<VisitedNode> nodeIterator()

getNode

public VisitedNode getNode(long nodeId)

getSubPathFromRoot

public LogicalSubPath getSubPathFromRoot(long nodeId,
                                         LinkCostCalculator[] lccs,
                                         NodeCostCalculator[] nccs,
                                         NetworkExplorer ne)
                                  throws LODNetworkException

Throws:

LODNetworkException

isRoot

public boolean isRoot(long nodeId)

removeNode

public void removeNode(long nodeId)