Package uk.ac.man.cs.mig.util.graph.model.impl

Examples of uk.ac.man.cs.mig.util.graph.model.impl.DefaultGraphModel

15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
*/
public class DefaultModelTestCase extends TestCase
{
  public void testAddition()
  {
    DefaultGraphModel model = new DefaultGraphModel();

    model.add("Node00");

    model.add("Node01");

    model.add("Node02");

    model.add("Node00", "Node10");

    model.add("Node01", "Node10");

    model.add("Node02", "Node10");

    model.add("Node10", "Node20");

    model.add("Node10", "Node21");


    assertTrue(model.getParentCount("Node10") == 3);

    assertTrue(model.getChildCount("Node10") == 2);




  }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
  private ArrayList thumbnailViewSourceListeners;


  public GraphComponent() {
    controller = new DefaultController(new DefaultGraphModel());

    this.setLayout(new BorderLayout());

    this.add(scrollPane = new JScrollPane(controller.getGraphView()));
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
    frame2.setSize(1024, 300);

    frame2.setLocation(0, 320);

    model = new DefaultGraphModel();


    controller1 = new DefaultController(model);

    controller2 = new DefaultController(model);
View Full Code Here
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
  {
    Random rand = new Random();

    rand.setSeed(System.currentTimeMillis());

    DefaultGraphModel mod = new DefaultGraphModel();

    DefaultGraphNode node0 = null, node1 = null, node2 = null;

    rootNode = new DefaultGraphNode("Node0");

    mod.add(rootNode);

    for(int i = 0; i < 220; i++)
    {
      rootNode.addChild(node0 = new DefaultGraphNode("Node1." + i));

      mod.add(node0);
    }

    for(int i = 0; i < 220; i++)
    {
      if(rand.nextBoolean() == true)
      {
        node0.addChild(node1 = new DefaultGraphNode("Node2." + i));

        mod.add(node1);

        if(rand.nextBoolean() == true)
        {
          rootNode.addParent(node1);
        }
      }
    }

    for(int i = 0; i < 220; i++)
    {
      if(rand.nextBoolean() == true)
      {
        node1.addChild(node2 = new DefaultGraphNode("Node3." + i));

        mod.add(node2);
      }
    }

    return mod;
  }
View Full Code Here
TOP

Related Classes of uk.ac.man.cs.mig.util.graph.model.impl.DefaultGraphModel

  • uk.ac.man.cs.mig.util.graph.test.DefaultModelTestCase
  • uk.ac.man.cs.mig.util.graph.test.TestFrame
  • uk.ac.man.cs.mig.util.graph.ui.GraphComponent
  • java.util.HashMap
  • java.util.Iterator
  • java.util.ArrayList
    • 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.