Uses of Interface
prefuse.data.Node

Packages that use Node
prefuse The top-level Visualization and Display classes, as well as Constants used throughout the toolkit. 
prefuse.data Table, Graph, and Tree data structures for organizing data. 
prefuse.data.tree   
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, iterables, 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
 

Methods in prefuse with type parameters of type Node
<N extends Node<N,E>,E extends Edge<N,E>>
VisualGraph<TableVisualItem<?>,TableNodeItem,TableEdgeItem>
Visualization.addGraph(java.lang.String group, Graph<?,N,E> graph, Predicate filter, Schema nodeSchema, Schema edgeSchema)
          Adds a graph to this visualization, using the given data group name.
<T extends Node<?,?>>
VisualTable<T,TableNodeItem>
Visualization.addNodeTable(java.lang.String group, Table<T> table, Predicate filter, Schema schema)
          Adds a data table to this visualization, using the given data group name.
<N extends Node<N,E>,E extends Edge<N,E>>
VisualTree<VisualItem<?>,TableNodeItem,TableEdgeItem>
Visualization.addTree(java.lang.String group, Tree<?,N,E> tree, Predicate filter, Schema nodeSchema, Schema edgeSchema)
          Adds a tree to this visualization, using the given data group name.
 

Uses of Node in prefuse.data
 

Classes in prefuse.data with type parameters of type Node
 interface Edge<N extends Node<N,E>,E extends Edge<N,E>>
          Tuple sub-interface that represents an edge in a graph structure.
 class Graph<T extends Tuple<?>,N extends Node<N,E>,E extends Edge<N,E>>
          A Graph models a network of nodes connected by a collection of edges.
 interface Node<N extends Node<N,E>,E extends Edge<N,E>>
          Tuple sub-interface that represents a node in a graph or tree structure.
 class SpanningTree<T extends Tuple<?>,N extends Node<N,E>,E extends Edge<N,E>>
          Special tree instance for storing a spanning tree over a graph instance.
 class Tree<T extends Tuple<?>,N extends Node<N,E>,E extends Edge<N,E>>
          Graph subclass that models a tree structure of hierarchical parent-child relationships.
 

Methods in prefuse.data with parameters of type Node
 N Tree.addChild(Node<?,?> parent)
          Add a child node to the given parent node.
 N SpanningTree.addChild(Node<?,?> parent)
          Unsupported operation.
 E Tree.addChildEdge(Node<?,?> parent, Node<?,?> child)
          Add a child edge between the given nodes.
 E Tree.addChildEdge(Node<?,?> parent, Node<?,?> child)
          Add a child edge between the given nodes.
 E SpanningTree.addChildEdge(Node<?,?> parent, Node<?,?> child)
          Unsupported operation.
 E SpanningTree.addChildEdge(Node<?,?> parent, Node<?,?> child)
          Unsupported operation.
 E SpanningTree.addEdge(Node<?,?> s, Node<?,?> t)
          Unsupported operation.
 E SpanningTree.addEdge(Node<?,?> s, Node<?,?> t)
          Unsupported operation.
 E Graph.addEdge(Node<?,?> s, Node<?,?> t)
          Add an edge to the graph.
 E Graph.addEdge(Node<?,?> s, Node<?,?> t)
          Add an edge to the graph.
 N Graph.getAdjacentNode(Edge<?,?> e, Node<?,?> n)
          Given an Edge and an incident Node, return the other Node connected to the edge.
 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.
 E Graph.getEdge(Node<?,?> source, Node<?,?> target)
          Get an Edge with given source and target Nodes.
 E Graph.getEdge(Node<?,?> source, Node<?,?> target)
          Get an Edge with given source and target Nodes.
 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.
protected  boolean Graph.nodeCheck(Node<?,?> n, boolean throwException)
          Internal method for checking the validity of a node.
 boolean Tree.removeChild(Node<?,?> n)
          Remove a node and its entire subtree rooted at the node from the tree.
 boolean SpanningTree.removeChild(Node<?,?> n)
          Unsupported operation.
 boolean SpanningTree.removeNode(Node<?,?> n)
          Unsupported operation.
 boolean Graph.removeNode(Node<?,?> n)
          Remove a node from the graph, also removing all incident edges.
 

Uses of Node in prefuse.data.tree
 

Classes in prefuse.data.tree with type parameters of type Node
 class AbstractDeclarativeTree<N extends Node<N,E>,E extends Edge<N,E>>
          This is a base implementation for a declarative tree.
 interface DeclarativeTree<N extends Node<?,?>,E extends Edge<?,?>>
          This is intended to be a lightweight means of defining a Tree across an existing Graph.
 class FilteredDeclarativeTree<N extends Node<N,E>,E extends Edge<N,E>>
          Allows a tree subset to be defined.
 class NodeBasedDeclarativeTree<N extends Node<N,E>,E extends Edge<N,E>>
          Implements a DeclarativeTree using the supplied node as the root node of the tree.
 

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.
 

Uses of Node in prefuse.data.util
 

Classes in prefuse.data.util with type parameters of type Node
 class NeighborList<N extends Node<N,E>,E extends Edge<N,E>>
          Iterator over neighbors of a given Node.
 class TreeNodeIterator<N extends Node<N,?>>
          A depth-first iterator over the subtree rooted at given node.
 

Methods in prefuse.data.util with parameters of type Node
protected  java.util.List<Edge<?,?>> BreadthFirstIterator.getEdges(Node<?,?> n)
          Determines which edges are traversed for a given node.
 

Constructors in prefuse.data.util with parameters of type Node
BreadthFirstIterator(Node<?,?> n, int depth, TraversalType 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<N extends NodeItem<N,E>,E extends EdgeItem<N,E>>
          VisualItem that represents a node in a graph.
 

Constructor parameters in prefuse.visual with type arguments of type Node
VisualGraph(VisualTable<? extends Node<?,?>,N> nodes, VisualTable<? extends Edge<?,?>,E> edges, boolean directed, java.lang.String nodeKey, java.lang.String sourceKey, java.lang.String targetKey)
          Create a new VisualGraph
 

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.
 



Copyright © 2008 Regents of the University of California