|
Oracle® Spatial Java API Reference 11g Release 1 (11.1) B28401-01 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface Tree
This interface defines a tree for trace-out. The nodes of the tree can either be network nodes or virtual nodes on network links.
Method Summary | |
---|---|
TreeNode[] |
bestFirstSearch() Best First Search based on cost |
TreeNode[] |
breadthFirstSearch() Breadth First Search |
void |
clear() Clears the tree structure |
boolean |
containsPartialLinks() Does the tree contain particial links? |
TreeNode[] |
depthFirstSearch() Depth First Search |
TreeNode |
get(Node node) Returns the tree node that contains the given network node |
TreeNode[] |
getLeafNodeArray() Returns leaf nodes in an array |
TreeNode |
getRootNode() Returns the root node |
SubPath |
getSubPath(TreeNode treeNode) Returns the subpath between the given tree node and the root node |
boolean |
isForward() Returns the traverse direction |
boolean |
isLogical() Checks if the tree is logical |
int |
size() Returns number of tree nodes |
Method Detail |
---|
TreeNode getRootNode()
boolean containsPartialLinks()
void clear()
TreeNode[] depthFirstSearch()
TreeNode[] breadthFirstSearch()
TreeNode[] bestFirstSearch()
TreeNode[] getLeafNodeArray()
boolean isLogical()
TreeNode get(Node node)
node
- given network nodeint size()
boolean isForward()
SubPath getSubPath(TreeNode treeNode) throws NetworkDataException
treeNode
- the given tree node in the treeNetworkDataException
|
Oracle® Spatial Java API Reference 11g Release 1 (11.1) B28401-01 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |