public interface Node extends Tuple
Modifier and Type | Method and Description |
---|---|
java.util.Iterator |
childEdges()
Get an iterator over the edges from this node to its tree children.
|
java.util.Iterator |
children()
Get an iterator over this node's tree children.
|
java.util.Iterator |
edges()
Get an iterator over all incident edges, those for which this node
is either the source or the target.
|
Node |
getChild(int idx)
Get the tree child node at the given index.
|
int |
getChildCount()
Get the number of tree children of this node.
|
int |
getChildIndex(Node child)
Get the ordering index of the give node child in a tree
structure.
|
int |
getDegree()
Get the degree of the node, the number of edges for which this node
is either the source or the target.
|
int |
getDepth()
Get the tree depth of this node.
|
Node |
getFirstChild()
Get this node's first tree child.
|
Graph |
getGraph()
Get the Graph of which this Node is a member.
|
int |
getInDegree()
Get the in-degree of the node, the number of edges for which this node
is the target.
|
Node |
getLastChild()
Get this node's last tree child.
|
Node |
getNextSibling()
Get this node's next tree sibling.
|
int |
getOutDegree()
Get the out-degree of the node, the number of edges for which this node
is the source.
|
Node |
getParent()
Get the parent node of this node in a tree structure.
|
Edge |
getParentEdge()
Get the edge between this node and its parent node in a tree
structure.
|
Node |
getPreviousSibling()
Get this node's previous tree sibling.
|
java.util.Iterator |
inEdges()
Get an iterator over all incoming edges, those for which this node
is the target.
|
java.util.Iterator |
inNeighbors()
Get an iterator over all adjacent nodes connected to this node by an
incoming edge (i.e., all nodes that "point" at this one).
|
java.util.Iterator |
neighbors()
Get an iterator over all nodes connected to this node.
|
java.util.Iterator |
outEdges()
Get an iterator over all outgoing edges, those for which this node
is the source.
|
java.util.Iterator |
outNeighbors()
Get an iterator over all adjacent nodes connected to this node by an
outgoing edge (i.e., all nodes "pointed" to by this one).
|
canGet, canGetBoolean, canGetDate, canGetDouble, canGetFloat, canGetInt, canGetLong, canGetString, canSet, canSetBoolean, canSetDate, canSetDouble, canSetFloat, canSetInt, canSetLong, canSetString, get, get, getBoolean, getBoolean, getColumnCount, getColumnIndex, getColumnName, getColumnType, getColumnType, getDate, getDate, getDefault, getDouble, getDouble, getFloat, getFloat, getInt, getInt, getLong, getLong, getRow, getSchema, getString, getString, getTable, isValid, revertToDefault, set, set, setBoolean, setBoolean, setDate, setDate, setDouble, setDouble, setFloat, setFloat, setInt, setInt, setLong, setLong, setString, setString
Graph getGraph()
int getInDegree()
int getOutDegree()
int getDegree()
java.util.Iterator inEdges()
java.util.Iterator outEdges()
java.util.Iterator edges()
java.util.Iterator inNeighbors()
java.util.Iterator outNeighbors()
java.util.Iterator neighbors()
Node getParent()
Edge getParentEdge()
int getDepth()
int getChildCount()
int getChildIndex(Node child)
child
- the child node to look upNode getChild(int idx)
idx
- the ordering indexNode getFirstChild()
Node getLastChild()
Node getPreviousSibling()
Node getNextSibling()
java.util.Iterator children()
java.util.Iterator childEdges()
Copyright ? 2013 Regents of the University of California