Package prefuse.data

Examples of prefuse.data.Tree

127
128
129
130
131
132
133
134
135
136
137
138
139
   
    /**
     * @see prefuse.action.GroupAction#run(double)
     */
    public void run(double frac) {
        Tree tree = ((Graph)m_vis.getGroup(m_group)).getSpanningTree();
        m_divisor = tree.getNodeCount();
        m_root = (NodeItem)tree.getRoot();
       
        // mark the items
        Iterator items = m_vis.visibleItems(m_group);
        while ( items.hasNext() ) {
            VisualItem item = (VisualItem)items.next();
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
    public static final String TREE_CHI = "/chi-ontology.xml.gz";
   
    public void testTreeReader() {
        // load tree
        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();
            fail();
        }
       
        assertEquals(true, t.isValidTree());
       
        Node[] nodelist = new Node[t.getNodeCount()];
       
        Iterator nodes = t.nodes();
        for ( int i=0; nodes.hasNext(); ++i ) {
            nodelist[i] = (Node)nodes.next();
        }
        assertEquals(false, nodes.hasNext());
    }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
        }
        assertEquals(false, nodes.hasNext());
    }
   
    public void testAddChild() {
        Tree tree = GraphLib.getBalancedTree(2,1);
        Node r = tree.getRoot();
        Node n = tree.addChild(r);
        assertEquals(true, n!=null);
        n.setString("label", "new node");
        assertEquals(r.getLastChild(), n);
    }
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
        n.setString("label", "new node");
        assertEquals(r.getLastChild(), n);
    }
   
    public void testRemoveChild() {
        Tree tree = GraphLib.getBalancedTree(2,1);
        int size = tree.getNodeCount();
        Node r = tree.getRoot();
        Node c = r.getFirstChild();
        Edge e = c.getParentEdge();
       
        assertEquals(true, tree.removeChild(c));
        assertEquals(tree.getNodeCount(), size-1);
        assertEquals(false, c.isValid());
        assertEquals(false, e.isValid());
        assertEquals(true, r.getFirstChild() != c);
    }
View Full Code Here
178
179
180
181
182
183
184
185
186
187
188
    public static JComponent demo() {
        return demo(TREE_CHI, "name");
    }
   
    public static JComponent demo(String datafile, final String label) {
        Tree t = null;
        try {
            t = (Tree)new TreeMLReader().readGraph(datafile);
        } catch ( Exception e ) {
            e.printStackTrace();
            System.exit(1);
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.