Package prefuse.data

Examples of prefuse.data.Node

48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
     */
    public static Graph getStar(int n) {
        Graph g = new Graph();
        g.getNodeTable().addColumns(LABEL_SCHEMA);
       
        Node r = g.addNode();
        r.setString(LABEL, "0");
       
        for ( int i=1; i <= n; ++i ) {
            Node nn = g.addNode();
            nn.setString(LABEL, String.valueOf(i));
            g.addEdge(r, nn);
        }
        return g;
    }
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
     */
    public static Graph getClique(int n) {
        Graph g = new Graph();
        g.getNodeTable().addColumns(LABEL_SCHEMA);
       
        Node nodes[] = new Node[n];
        for ( int i = 0; i < n; ++i ) {
            nodes[i] = g.addNode();
            nodes[i].setString(LABEL, String.valueOf(i));
        }
        for ( int i = 0; i < n; ++i ) {
View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
        Graph g = new Graph();
        g.getNodeTable().addColumns(LABEL_SCHEMA);
        ArrayList layer1 = halfcomb(g, levels);
        ArrayList layer2 = halfcomb(g, levels);
        for ( int i=0; i<(levels<<1); ++i ) {
            Node n1 = (Node)layer1.get(i);
            Node n2 = (Node)layer2.get(i);
            g.addEdge(n1, n2);
        }
        return g;
    }
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
        ArrayList layer = new ArrayList();
       
        int label = 0;
       
        for ( int i=0; i<levels; ++i ) {
            Node n = g.addNode();
            n.setString(LABEL, String.valueOf(label++));
            top.add(n);
        }
        for ( int i=0; i<levels; ++i ) {
            Node n = null;
            for ( int j=0; j<top.size(); ++j ) {
                Node p = (Node)top.get(j);
                if ( n == null ) {
                    n = g.addNode();
                    n.setString(LABEL, String.valueOf(label++));
                    layer.add(n);
                }
                g.addEdge(p, n);
                n = g.addNode();
                n.setString(LABEL, String.valueOf(label++));
                layer.add(n);
                g.addEdge(p, n);
            }
            if ( i == levels-1 ) {
                return layer;
            }
            top.clear();
            for ( int j=0; j<layer.size(); ++j ) {
                Node p = (Node)layer.get(j);
                n = g.addNode();
                n.setString(LABEL, String.valueOf(label++));
                top.add(n);
                g.addEdge(p, n);
            }
View Full Code Here
171
172
173
174
175
176
177
178
179
180
181
182
     */
    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
183
184
185
186
187
188
189
190
191
192
193
   
    private static void balancedHelper(Tree t, Node n,
            int breadth, int depth)
    {
        for ( int i=0; i<breadth; ++i ) {
            Node c = t.addChild(n);
            c.setString(LABEL, i+","+c.getDepth());
            if ( depth > 0 )
                balancedHelper(t,c,breadth,depth-1);
        }
    }
View Full Code Here
199
200
201
202
203
204
205
206
207
208
209
     */
    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
215
216
217
218
219
220
221
222
223
224
225
     */
    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
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
     */
    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);
       
        while ( left.getFirstChild() != null )
            left = left.getFirstChild();
        while ( right.getLastChild() != null )
            right = right.getLastChild();
       
        deepHelper(t, left, b, d2-1, false);
        deepHelper(t, right, b, d2-1, true);
       
        return t;
View Full Code Here
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
    }
   
    private static void deepHelper(Tree t, Node n,
            int breadth, int depth, boolean left)
    {
        Node c = t.addChild(n);
        c.setString(LABEL, "0,"+c.getDepth());
        if ( left && depth > 0 )
            deepHelper(t, c, breadth, depth-1, left);
       
        for ( int i=1; i<breadth; ++i ) {
            c = t.addChild(n);
            c.setString(LABEL, i+","+c.getDepth());
        }
        if ( !left && depth > 0 )
            deepHelper(t, c, breadth, depth-1, left);
    }
View Full Code Here
TOP

Related Classes of prefuse.data.Node

  • org.cishell.testing.convertertester.core.tester.graphcomparison.DefaultGraphComparer
  • org.cishell.testing.convertertester.core.tester2.graphcomparison.IdsNotPreservedComparer
  • org.picocontainer.gems.monitors.prefuse.PrefuseDependencyGraph
  • org.qi4j.envisage.graph.GraphBuilder
  • org.rioproject.tools.ui.GraphUtil
  • org.rioproject.tools.ui.GraphView
  • org.rioproject.tools.ui.GraphView$TreeRootAction
  • paperscope.PaperScopeSession
  • paperscope.RadialGraph
  • paperscope.RadialGraph$TreeRootAction
    • 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.