Package | Description |
---|---|
prefuse.data |
Table, Graph, and Tree data structures for organizing data.
|
prefuse.data.tuple |
Implementing classes for data tuples, object proxies to a row of table
data.
|
prefuse.data.util |
Utility classes for supporting prefuse data structures, including
indexes, iterators, filters, and column projections.
|
prefuse.visual |
Classes for representing and storing VisualItems.
|
prefuse.visual.tuple |
Implementations of VisualItem types and backing TupleManager
instances.
|
Modifier and Type | Method and Description |
---|---|
Node |
SpanningTree.addChild(Node parent)
Unsupported operation.
|
Node |
Tree.addChild(Node parent)
Add a child node to the given parent node.
|
Node |
SpanningTree.addNode()
Unsupported operation.
|
Node |
Graph.addNode()
Add a new node to the graph.
|
Node |
SpanningTree.addRoot()
Unsupported operation.
|
Node |
Tree.addRoot()
Add a new root node to an empty Tree.
|
Node |
Graph.getAdjacentNode(Edge e,
Node n)
Given an Edge and an incident Node, return the other Node
connected to the edge.
|
Node |
Edge.getAdjacentNode(Node n)
Given a Node upon which this Edge is incident, the opposite incident
Node is returned.
|
Node |
Node.getChild(int idx)
Get the tree child node at the given index.
|
Node |
Tree.getChild(Node node,
int idx)
Get the child node at the given index.
|
Node |
Node.getFirstChild()
Get this node's first tree child.
|
Node |
Tree.getFirstChild(Node node)
Get the first child node of the given parent node.
|
Node |
Node.getLastChild()
Get this node's last tree child.
|
Node |
Tree.getLastChild(Node node)
Get the last child node of the given parent node.
|
Node |
Node.getNextSibling()
Get this node's next tree sibling.
|
Node |
Tree.getNextSibling(Node node)
Get the next sibling of the given node.
|
Node |
Graph.getNode(int n)
Get the Node tuple instance corresponding to a node id.
|
Node |
Graph.getNodeFromKey(long key)
Get the Node tuple corresponding to the input node key field value.
|
Node |
Node.getParent()
Get the parent node of this node in a tree structure.
|
Node |
Tree.getParent(Node n)
Get a node's parent node
|
Node |
Node.getPreviousSibling()
Get this node's previous tree sibling.
|
Node |
Tree.getPreviousSibling(Node node)
Get the previous sibling of the given node.
|
Node |
Tree.getRoot()
Get the root node.
|
Node |
Edge.getSourceNode()
Returns the first, or source, node upon which this Edge
is incident.
|
Node |
Graph.getSourceNode(Edge e)
Get the source Node for the given Edge instance.
|
Node |
Edge.getTargetNode()
Returns the second, or target, node upon which this Edge
is incident.
|
Node |
Graph.getTargetNode(Edge e)
Get the target Node for the given Edge instance.
|
Modifier and Type | Method and Description |
---|---|
Node |
SpanningTree.addChild(Node parent)
Unsupported operation.
|
Node |
Tree.addChild(Node parent)
Add a child node to the given parent node.
|
Edge |
SpanningTree.addChildEdge(Node parent,
Node child)
Unsupported operation.
|
Edge |
Tree.addChildEdge(Node parent,
Node child)
Add a child edge between the given nodes.
|
Edge |
SpanningTree.addEdge(Node s,
Node t)
Unsupported operation.
|
Edge |
Graph.addEdge(Node s,
Node t)
Add an edge to the graph.
|
void |
SpanningTree.buildSpanningTree(Node root)
Build the spanning tree, starting at the given root.
|
java.util.Iterator |
Tree.childEdges(Node n)
Get an iterator over the edges connecting child nodes to a given parent
|
java.util.Iterator |
Tree.children(Node n)
Get an iterator over the child nodes of a parent node.
|
java.util.Iterator |
Graph.edges(Node node)
Get an iterator over all Edges connected to the given Node in the graph.
|
Node |
Graph.getAdjacentNode(Edge e,
Node n)
Given an Edge and an incident Node, return the other Node
connected to the edge.
|
Node |
Edge.getAdjacentNode(Node n)
Given a Node upon which this Edge is incident, the opposite incident
Node is returned.
|
Node |
Tree.getChild(Node node,
int idx)
Get the child node at the given index.
|
int |
Node.getChildIndex(Node child)
Get the ordering index of the give node child in a tree
structure.
|
int |
Tree.getChildIndex(Node p,
Node c)
Get the child index (order number of the child) for the given parent
and child nodes.
|
int |
Graph.getDegree(Node n)
Get the degree of a node, the number of edges for which a node
is either the source or the target.
|
Edge |
Graph.getEdge(Node source,
Node target)
Get an Edge with given source and target Nodes.
|
Node |
Tree.getFirstChild(Node node)
Get the first child node of the given parent node.
|
int |
Graph.getInDegree(Node n)
Get the in-degree of a node, the number of edges for which the node
is the target.
|
Node |
Tree.getLastChild(Node node)
Get the last child node of the given parent node.
|
Node |
Tree.getNextSibling(Node node)
Get the next sibling of the given node.
|
int |
Graph.getOutDegree(Node n)
Get the out-degree of a node, the number of edges for which the node
is the source.
|
Node |
Tree.getParent(Node n)
Get a node's parent node
|
Edge |
Tree.getParentEdge(Node n)
Get the edge to the given node's parent.
|
Node |
Tree.getPreviousSibling(Node node)
Get the previous sibling of the given node.
|
Tree |
Graph.getSpanningTree(Node root)
Returns a spanning tree rooted at the specified node.
|
Tree |
Tree.getSpanningTree(Node root)
Returns a spanning tree over this tree, rooted at the given root.
|
java.util.Iterator |
Graph.inEdges(Node node)
Get an iterator over all in-linking edges to the given Node.
|
java.util.Iterator |
Graph.inNeighbors(Node n)
Get an iterator over all in-linking neighbor nodes for the given Node.
|
java.util.Iterator |
Graph.neighbors(Node n)
Get an iterator over all neighbor nodes for the given Node in the graph.
|
protected boolean |
Graph.nodeCheck(Node n,
boolean throwException)
Internal method for checking the validity of a node.
|
java.util.Iterator |
Graph.outEdges(Node node)
Get an iterator over all out-linking edges from the given Node.
|
java.util.Iterator |
Graph.outNeighbors(Node n)
Get an iterator over all out-linking neighbor nodes for the given Node.
|
boolean |
SpanningTree.removeChild(Node n)
Unsupported operation.
|
boolean |
Tree.removeChild(Node n)
Remove a node and its entire subtree rooted at the node from the tree.
|
boolean |
SpanningTree.removeNode(Node n)
Unsupported operation.
|
boolean |
Graph.removeNode(Node n)
Remove a node from the graph, also removing all incident edges.
|
Constructor and Description |
---|
SpanningTree(Graph g,
Node root)
Create a new SpanningTree.
|
Modifier and Type | Class and Description |
---|---|
class |
TableNode
Node implementation that reads Node data from a backing node table.
|
Modifier and Type | Method and Description |
---|---|
Node |
TableEdge.getAdjacentNode(Node n) |
Node |
TableNode.getChild(int idx) |
Node |
TableNode.getFirstChild() |
Node |
TableNode.getLastChild() |
Node |
TableNode.getNextSibling() |
Node |
TableNode.getParent() |
Node |
TableNode.getPreviousSibling() |
Node |
TableEdge.getSourceNode() |
Node |
TableEdge.getTargetNode() |
Modifier and Type | Method and Description |
---|---|
Node |
TableEdge.getAdjacentNode(Node n) |
int |
TableNode.getChildIndex(Node child) |
Modifier and Type | Method and Description |
---|---|
protected java.util.Iterator |
BreadthFirstIterator.getEdges(Node n)
Determines which edges are traversed for a given node.
|
Constructor and Description |
---|
BreadthFirstIterator(Node n,
int depth,
int traversal)
Create a new BreadthFirstIterator starting from the given source node.
|
NeighborIterator(Node n,
java.util.Iterator edges)
Create a new NeighborIterator.
|
TreeNodeIterator(Node root)
Create a new TreeNodeIterator over the given subtree.
|
TreeNodeIterator(Node root,
boolean preorder)
Create a new TreeNodeIterator over the given subtree.
|
Modifier and Type | Interface and Description |
---|---|
interface |
NodeItem
VisualItem that represents a node in a graph.
|
Modifier and Type | Class and Description |
---|---|
class |
TableNodeItem
NodeItem implementation that used data values from a backing
VisualTable of nodes.
|
Modifier and Type | Method and Description |
---|---|
Node |
TableEdgeItem.getAdjacentNode(Node n) |
Node |
TableNodeItem.getChild(int idx) |
Node |
TableNodeItem.getFirstChild() |
Node |
TableNodeItem.getLastChild() |
Node |
TableNodeItem.getNextSibling() |
Node |
TableNodeItem.getParent() |
Node |
TableNodeItem.getPreviousSibling() |
Node |
TableEdgeItem.getSourceNode() |
Node |
TableEdgeItem.getTargetNode() |
Modifier and Type | Method and Description |
---|---|
Node |
TableEdgeItem.getAdjacentNode(Node n) |
int |
TableNodeItem.getChildIndex(Node child) |
Copyright ? 2013 Regents of the University of California