Uses of Class
prefuse.data.tuple.TableEdge

Packages that use TableEdge
prefuse.data Table, Graph, and Tree data structures for organizing data. 
prefuse.data.io Input/output classes for reading and writing data from formatted files. 
prefuse.data.tuple Implementing classes for data tuples, object proxies to a row of table data. 
prefuse.util Utility classes for use by both the toolkit and applications, including color and font support. 
 

Uses of TableEdge in prefuse.data
 

Methods in prefuse.data that return types with arguments of type TableEdge
static Graph<TableTuple<?>,TableNode,TableEdge> Graph.createGraph()
          Creates a new, empty undirected Graph.
static Graph<TableTuple<?>,TableNode,TableEdge> Graph.createGraph(boolean directed)
          Creates a new, empty Graph.
static Graph<TableTuple<?>,TableNode,TableEdge> Graph.createGraph(Table<TableNode> nodes, boolean directed)
          Create a new Graph using the provided table of node data and an empty set of edges.
static Graph<TableTuple<?>,TableNode,TableEdge> Graph.createGraph(Table<TableNode> nodes, boolean directed, java.lang.String nodeKey, java.lang.String sourceKey, java.lang.String targetKey)
          Create a new Graph using the provided table of node data and an empty set of edges.
static Graph<TableTuple<?>,TableNode,TableEdge> Graph.createGraph(Table<TableNode> nodes, Table<TableEdge> edges, boolean directed)
           
static Tree<TableTuple<?>,TableNode,TableEdge> Tree.createTree()
          Create a new, empty Tree.
 

Method parameters in prefuse.data with type arguments of type TableEdge
static Graph<TableTuple<?>,TableNode,TableEdge> Graph.createGraph(Table<TableNode> nodes, Table<TableEdge> edges, boolean directed)
           
 

Uses of TableEdge in prefuse.data.io
 

Fields in prefuse.data.io with type parameters of type TableEdge
protected  Table<TableEdge> GraphMLReader.GraphMLHandler.m_edges
           
protected  Graph<TableTuple<?>,TableNode,TableEdge> GraphMLReader.GraphMLHandler.m_graph
           
 

Methods in prefuse.data.io that return types with arguments of type TableEdge
 Graph<TableTuple<?>,TableNode,TableEdge> GraphMLReader.GraphMLHandler.getGraph()
           
 

Uses of TableEdge in prefuse.data.tuple
 

Fields in prefuse.data.tuple with type parameters of type TableEdge
protected  Graph<TableTuple<?>,TableNode,TableEdge> TableNode.m_graph
          The backing graph.
protected  Graph<?,TableNode,TableEdge> TableEdge.m_graph
          The backing graph.
 

Methods in prefuse.data.tuple that return TableEdge
 TableEdge TableNode.getParentEdge()
           
 

Methods in prefuse.data.tuple that return types with arguments of type TableEdge
 java.util.List<TableEdge> TableNode.childEdges()
           
 java.util.List<TableEdge> TableNode.edges()
           
 Graph<?,TableNode,TableEdge> TableNode.getGraph()
           
 Graph<?,TableNode,TableEdge> TableEdge.getGraph()
           
 java.util.List<TableEdge> TableNode.inEdges()
           
 java.util.List<TableEdge> TableNode.outEdges()
           
 

Uses of TableEdge in prefuse.util
 

Methods in prefuse.util that return types with arguments of type TableEdge
static Tree<TableTuple<?>,TableNode,TableEdge> GraphLib.getBalancedTree(int breadth, int depth)
          Returns a balanced tree of the requested breadth and depth.
static Graph<TableTuple<?>,TableNode,TableEdge> GraphLib.getClique(int n)
          Returns a clique of given size.
static Tree<TableTuple<?>,TableNode,TableEdge> GraphLib.getDiamondTree(int b, int d1, int d2)
          Create a diamond tree, with a given branching factor at each level, and depth levels for the two main branches.
static Graph<TableTuple<?>,TableNode,TableEdge> GraphLib.getGrid(int m, int n)
          Returns a graph structured as an m-by-n grid.
static Graph<TableTuple<?>,TableNode,TableEdge> GraphLib.getHoneycomb(int levels)
           
static Tree<TableTuple<?>,TableNode,TableEdge> GraphLib.getLeftDeepTree(int depth)
          Returns a left deep binary tree
static Graph<TableTuple<?>,TableNode,TableEdge> GraphLib.getNodes(int n)
          Builds a completely unconnected (edge-free) graph with the given number of nodes
static Tree<TableTuple<?>,TableNode,TableEdge> GraphLib.getRightDeepTree(int depth)
          Returns a right deep binary tree
static Graph<TableTuple<?>,TableNode,TableEdge> GraphLib.getStar(int n)
          Builds a "star" graph with one central hub connected to the given number of satellite nodes.
 



Copyright © 2008 Regents of the University of California