Uses of Interface
prefuse.data.Node

Packages that use Node
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. 
 

Uses of Node in prefuse.data
 

Methods in prefuse.data that return Node
 Node Edge.getSourceNode()
          Returns the first, or source, node upon which this Edge is incident.
 Node Edge.getTargetNode()
          Returns the second, or target, node upon which this Edge is incident.
 Node Edge.getAdjacentNode(Node n)
          Given a Node upon which this Edge is incident, the opposite incident Node is returned.
 Node Node.getParent()
          Get the parent node of this node in a tree structure.
 Node Node.getChild(int idx)
          Get the tree child node at the given index.
 Node Node.getFirstChild()
          Get this node's first tree child.
 Node Node.getLastChild()
          Get this node's last tree child.
 Node Node.getPreviousSibling()
          Get this node's previous tree sibling.
 Node Node.getNextSibling()
          Get this node's next tree sibling.
 Node SpanningTree.addChild(Node parent)
          Unsupported operation.
 Node SpanningTree.addRoot()
          Unsupported operation.
 Node SpanningTree.addNode()
          Unsupported operation.
 Node Graph.addNode()
          Add a new node to the graph.
 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 Graph.getSourceNode(Edge e)
          Get the source Node for the given Edge instance.
 Node Graph.getTargetNode(Edge e)
          Get the target Node for the given Edge instance.
 Node Graph.getAdjacentNode(Edge e, Node n)
          Given an Edge and an incident Node, return the other Node connected to the edge.
 Node Tree.addRoot()
          Add a new root node to an empty Tree.
 Node Tree.addChild(Node parent)
          Add a child node to the given parent node.
 Node Tree.getRoot()
          Get the root node.
 Node Tree.getChild(Node node, int idx)
          Get the child node at the given index.
 Node Tree.getFirstChild(Node node)
          Get the first child node of the given parent node.
 Node Tree.getLastChild(Node node)
          Get the last child node of the given parent node.
 Node Tree.getPreviousSibling(Node node)
          Get the previous sibling of the given node.
 Node Tree.getNextSibling(Node node)
          Get the next sibling of the given node.
 Node Tree.getParent(Node n)
          Get a node's parent node
 

Methods in prefuse.data with parameters of type Node
 Node Edge.getAdjacentNode(Node n)
          Given a Node upon which this Edge is incident, the opposite incident Node is returned.
 int Node.getChildIndex(Node child)
          Get the ordering index of the give node child in a tree structure.
 void SpanningTree.buildSpanningTree(Node root)
          Build the spanning tree, starting at the given root.
 Node SpanningTree.addChild(Node parent)
          Unsupported operation.
 Edge SpanningTree.addChildEdge(Node parent, Node child)
          Unsupported operation.
 boolean SpanningTree.removeChild(Node n)
          Unsupported operation.
 Edge SpanningTree.addEdge(Node s, Node t)
          Unsupported operation.
 boolean SpanningTree.removeNode(Node n)
          Unsupported operation.
 Edge Graph.addEdge(Node s, Node t)
          Add an edge to the graph.
 boolean Graph.removeNode(Node n)
          Remove a node from the graph, also removing all incident edges.
protected  boolean Graph.nodeCheck(Node n, boolean throwException)
          Internal method for checking the validity of a node.
 int Graph.getInDegree(Node n)
          Get the in-degree of a node, the number of edges for which the node is the target.
 int Graph.getOutDegree(Node n)
          Get the out-degree of a node, the number of edges for which the node is the source.
 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 Graph.getAdjacentNode(Edge e, Node n)
          Given an Edge and an incident Node, return the other Node connected to the edge.
 java.util.Iterator Graph.neighbors(Node n)
          Get an iterator over all neighbor nodes for the given Node in the graph.
 java.util.Iterator Graph.inNeighbors(Node n)
          Get an iterator over all in-linking neighbor nodes for the given Node.
 java.util.Iterator Graph.outNeighbors(Node n)
          Get an iterator over all out-linking neighbor nodes for the given Node.
 java.util.Iterator Graph.edges(Node node)
          Get an iterator over all Edges connected to the given Node in the graph.
 java.util.Iterator Graph.inEdges(Node node)
          Get an iterator over all in-linking edges to the given Node.
 java.util.Iterator Graph.outEdges(Node node)
          Get an iterator over all out-linking edges from the given Node.
 Tree Graph.getSpanningTree(Node root)
          Returns a spanning tree rooted at the specified node.
 Node Tree.addChild(Node parent)
          Add a child node to the given parent node.
 Edge Tree.addChildEdge(Node parent, Node child)
          Add a child edge between the given nodes.
 boolean Tree.removeChild(Node n)
          Remove a node and its entire subtree rooted at the node from the tree.
 Node Tree.getChild(Node node, int idx)
          Get the child node at the given index.
 int Tree.getChildIndex(Node p, Node c)
          Get the child index (order number of the child) for the given parent and child nodes.
 Node Tree.getFirstChild(Node node)
          Get the first child node of the given parent node.
 Node Tree.getLastChild(Node node)
          Get the last child node of the given parent node.
 Node Tree.getPreviousSibling(Node node)
          Get the previous sibling of the given node.
 Node Tree.getNextSibling(Node node)
          Get the next sibling of the given node.
 Edge Tree.getParentEdge(Node n)
          Get the edge to the given node's parent.
 Node Tree.getParent(Node n)
          Get a node's parent node
 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.
 Tree Tree.getSpanningTree(Node root)
          Returns a spanning tree over this tree, rooted at the given root.
 

Constructors in prefuse.data with parameters of type Node
SpanningTree(Graph g, Node root)
          Create a new SpanningTree.
 

Uses of Node in prefuse.data.tuple
 

Classes in prefuse.data.tuple that implement Node
 class TableNode
          Node implementation that reads Node data from a backing node table.
 

Methods in prefuse.data.tuple that return Node
 Node TableNode.getParent()
           
 Node TableNode.getChild(int idx)
           
 Node TableNode.getFirstChild()
           
 Node TableNode.getLastChild()
           
 Node TableNode.getPreviousSibling()
           
 Node TableNode.getNextSibling()
           
 Node TableEdge.getSourceNode()
           
 Node TableEdge.getTargetNode()
           
 Node TableEdge.getAdjacentNode(Node n)
           
 

Methods in prefuse.data.tuple with parameters of type Node
 int TableNode.getChildIndex(Node child)
           
 Node TableEdge.getAdjacentNode(Node n)
           
 

Uses of Node in prefuse.data.util
 

Methods in prefuse.data.util with parameters of type Node
protected  java.util.Iterator BreadthFirstIterator.getEdges(Node n)
          Determines which edges are traversed for a given node.
 

Constructors in prefuse.data.util with parameters of type Node
TreeNodeIterator(Node root)
          Create a new TreeNodeIterator over the given subtree.
NeighborIterator(Node n, java.util.Iterator edges)
          Create a new NeighborIterator.
BreadthFirstIterator(Node n, int depth, int traversal)
          Create a new BreadthFirstIterator starting from the given source node.
 

Uses of Node in prefuse.visual
 

Subinterfaces of Node in prefuse.visual
 interface NodeItem
          VisualItem that represents a node in a graph.
 

Uses of Node in prefuse.visual.tuple
 

Classes in prefuse.visual.tuple that implement Node
 class TableNodeItem
          NodeItem implementation that used data values from a backing VisualTable of nodes.
 

Methods in prefuse.visual.tuple that return Node
 Node TableEdgeItem.getSourceNode()
           
 Node TableEdgeItem.getTargetNode()
           
 Node TableEdgeItem.getAdjacentNode(Node n)
           
 Node TableNodeItem.getParent()
           
 Node TableNodeItem.getChild(int idx)
           
 Node TableNodeItem.getFirstChild()
           
 Node TableNodeItem.getLastChild()
           
 Node TableNodeItem.getPreviousSibling()
           
 Node TableNodeItem.getNextSibling()
           
 

Methods in prefuse.visual.tuple with parameters of type Node
 Node TableEdgeItem.getAdjacentNode(Node n)
           
 int TableNodeItem.getChildIndex(Node child)
           
 



Copyright ? 2007 Regents of the University of California