public class TableNode extends TableTuple implements Node
Modifier and Type | Field and Description |
---|---|
protected Graph |
m_graph
The backing graph.
|
m_row, m_table
Constructor and Description |
---|
TableNode() |
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.
|
protected void |
init(Table table,
Graph graph,
int row)
Initialize a new Node backed by a node table.
|
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, toString
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
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
protected Graph m_graph
protected void init(Table table, Graph graph, int row)
init
in class TableTuple
table
- the node Tablegraph
- the backing Graphrow
- the row in the node table to which this Node instance
corresponds.public Graph getGraph()
Node
getGraph
in interface Node
Node.getGraph()
public int getInDegree()
Node
getInDegree
in interface Node
Node.getInDegree()
public int getOutDegree()
Node
getOutDegree
in interface Node
Node.getOutDegree()
public int getDegree()
Node
getDegree
in interface Node
Node.getDegree()
public java.util.Iterator inEdges()
Node
inEdges
in interface Node
Node.inEdges()
public java.util.Iterator outEdges()
Node
outEdges
in interface Node
Node.outEdges()
public java.util.Iterator edges()
Node
edges
in interface Node
Node.edges()
public java.util.Iterator inNeighbors()
Node
inNeighbors
in interface Node
Node.inNeighbors()
public java.util.Iterator outNeighbors()
Node
outNeighbors
in interface Node
Node.outNeighbors()
public java.util.Iterator neighbors()
Node
neighbors
in interface Node
Node.neighbors()
public Node getParent()
Node
getParent
in interface Node
Node.getParent()
public Edge getParentEdge()
Node
getParentEdge
in interface Node
Node.getParentEdge()
public int getChildCount()
Node
getChildCount
in interface Node
Node.getChildCount()
public int getChildIndex(Node child)
Node
getChildIndex
in interface Node
child
- the child node to look upNode.getChildIndex(prefuse.data.Node)
public Node getChild(int idx)
Node
getChild
in interface Node
idx
- the ordering indexNode.getChild(int)
public Node getFirstChild()
Node
getFirstChild
in interface Node
Node.getFirstChild()
public Node getLastChild()
Node
getLastChild
in interface Node
Node.getLastChild()
public Node getPreviousSibling()
Node
getPreviousSibling
in interface Node
Node.getPreviousSibling()
public Node getNextSibling()
Node
getNextSibling
in interface Node
Node.getNextSibling()
public java.util.Iterator children()
Node
children
in interface Node
Node.children()
public java.util.Iterator childEdges()
Node
childEdges
in interface Node
Node.childEdges()
public int getDepth()
Node
getDepth
in interface Node
Node.getDepth()
Copyright ? 2013 Regents of the University of California