Package prefuse.data

Examples of prefuse.data.Tree

61
62
63
64
65
66
67
68
69
70
71
72
        if ( m_root != null )
            return m_root;
       
        TupleSet ts = m_vis.getGroup(m_group);
        if ( ts instanceof Graph ) {
            Tree tree = ((Graph)ts).getSpanningTree();
            return (NodeItem)tree.getRoot();
        } else {
            throw new IllegalStateException("This action's data group does" +
                    "not resolve to a Graph instance.");
        }
    }
View Full Code Here
168
169
170
171
172
173
174
175
176
177
178
179
180
181
     * @param breadth the breadth of each level of the tree
     * @param depth the depth of the tree
     * @return a balanced tree
     */
    public static Tree getBalancedTree(int breadth, int depth) {
        Tree t = new Tree();
        t.getNodeTable().addColumns(LABEL_SCHEMA);
       
        Node r = t.addRoot();
        r.setString(LABEL, "0,0");
       
        if ( depth > 0 )
            balancedHelper(t, r, breadth, depth-1);
        return t;
View Full Code Here
196
197
198
199
200
201
202
203
204
205
206
207
208
209
     * Returns a left deep binary tree
     * @param depth the depth of the tree
     * @return the generated tree
     */
    public static Tree getLeftDeepTree(int depth) {
        Tree t = new Tree();
        t.getNodeTable().addColumns(LABEL_SCHEMA);
       
        Node r = t.addRoot();
        r.setString(LABEL, "0,0");
       
        deepHelper(t, r, 2, depth, true);
        return t;
    }
View Full Code Here
212
213
214
215
216
217
218
219
220
221
222
223
224
225
     * Returns a right deep binary tree
     * @param depth the depth of the tree
     * @return the generated Tree
     */
    public static Tree getRightDeepTree(int depth) {
        Tree t = new Tree();
        t.getNodeTable().addColumns(LABEL_SCHEMA);
       
        Node r = t.addRoot();
        r.setString(LABEL, "0,0");
       
        deepHelper(t, r, 2, depth, false);
        return t;
    }
View Full Code Here
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
     * @param d1 the length of the first (left) branch
     * @param d2 the length of the second (right) branch
     * @return the generated Tree
     */
    public static Tree getDiamondTree(int b, int d1, int d2) {
        Tree t = new Tree();
        t.getNodeTable().addColumns(LABEL_SCHEMA);
       
        Node r = t.addRoot();
        r.setString(LABEL, "0,0");
       
        Node left = t.addChild(r);
        left.setString(LABEL, "1,0");
        Node right = t.addChild(r);
        right.setString(LABEL, "1,1");
       
        deepHelper(t, left, b, d1-2, true);
        deepHelper(t, right, b, d1-2, false);
       
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
        if ( m_root != null )
            return m_root;
       
        TupleSet ts = m_vis.getGroup(m_group);
        if ( ts instanceof Graph ) {
            Tree tree = ((Graph)ts).getSpanningTree();
            return (NodeItem)tree.getRoot();
        } else {
            throw new IllegalStateException("This action's data group does" +
                    "not resolve to a Graph instance.");
        }
    }
View Full Code Here
86
87
88
89
90
91
92
93
       
        private Node m_activeNode = null;
        private boolean m_inSchema = true;
       
        public void startDocument() {
            m_tree = new Tree();
            m_nodes = m_tree.getNodeTable();
        }
View Full Code Here
280
281
282
283
284
285
286
287
288
289
290
   
    public static JComponent demo(String datafile, final String label) {
        Color BACKGROUND = Color.WHITE;
        Color FOREGROUND = Color.BLACK;
       
        Tree t = null;
        try {
            t = (Tree)new TreeMLReader().readGraph(datafile);
        } catch ( Exception e ) {
            e.printStackTrace();
            System.exit(1);
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
        assertEquals(false, e.isValid());
        assertEquals(true, r.getFirstChild() != c);
    }
   
    public void testRemoveSubtree() {
        Tree tree = GraphLib.getBalancedTree(3,3);
        int size = tree.getNodeCount();
        Node r = tree.getRoot();
        Node c = r.getFirstChild();
       
        Node[] nodes = new Node[13];
        Edge[] edges = new Edge[13];
        Iterator iter = new TreeNodeIterator(c);
        for ( int i=0; iter.hasNext(); ++i ) {
            nodes[i] = (Node)iter.next();
            edges[i] = (Edge)nodes[i].getParentEdge();
        }
       
        assertEquals(true, tree.removeChild(c));
        assertEquals(tree.getNodeCount(), size-13);
        assertEquals(true, r.getFirstChild() != c);
        for ( int i=0; i<nodes.length; ++i ) {
            assertEquals(false, nodes[i].isValid());
            assertEquals(false, edges[i].isValid());
        }
       
        assertEquals(true, tree.isValidTree());
    }
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
        assertEquals(true, tree.isValidTree());
    }
   
    public static void main(String[] argv) {
        URL url = TreeMap.class.getResource(TREE_CHI);
        Tree t = null;
        try {
            GZIPInputStream gzin = new GZIPInputStream(url.openStream());
            t = (Tree) new TreeMLReader().readGraph(gzin);
        } catch ( Exception e ) {
            e.printStackTrace();
            System.exit(1);
        }
       
        JPrefuseTable table = new JPrefuseTable(t.getEdgeTable());
        JFrame frame = new JFrame("edges");
        frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
        frame.getContentPane().add(new JScrollPane(table));
        frame.pack();
        frame.setVisible(true);
View Full Code Here
TOP

Related Classes of prefuse.data.Tree

  • prefuse.action.filter.FisheyeTreeFilter
  • prefuse.action.layout.graph.TreeLayout
  • prefuse.data.io.TreeMLReader$TreeMLHandler
  • prefuse.demos.TreeMap
  • prefuse.demos.TreeView
  • prefuse.util.collections.IntIterator
  • prefuse.util.GraphLib
  • test.prefuse.data.TreeTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.