Package primitives.graph

Examples of primitives.graph.Node

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
        double f_m = f((ClusterNode)icl, g);
        f_values.put(icl, f_m);
        F += f_m;
      }else{
        //nodes;
        Node n;
        n = icl.getNodes().toArray(new Node[1])[0];
        double f_n = f(n,g);
        f_values.put(icl,f_n);
        F += f_n;
      }
    }
   
    for(IClusterLevel icl : f_values.keySet()){
      double f = f_values.get(icl);
      ret += l(-Math.log(f/F)  ) - f * Math.log(f/F); 
    }
   
    //HIERARCHY ENCODING
    for(Node n : container.getNodesInLeaves()){
      for(Node nP : n.getTransitionsAsN()){
        ret += l(relativeDepth(container, lowestCommonAncestor(n,nP, ch), ch));
       
       
      }
     
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
        ClusterHead ch = new ClusterHead();
        Map<Integer, ClusterNode> parents = new HashMap<Integer, ClusterNode>();
        Set<Node> nodes = originalTree.getNodes();
        for (int i = 0; i < assignments.size(); i++) {
            int parentNumber = assignments.get(i).intValue();
            Node cur = nodenumbers.get(i + 1);



            if (cur == null) {
                throw new RuntimeException(String.format("ERROR: Missing node %d, known nodes: %s", i, nodenumbers.keySet()));
View Full Code Here
55
56
57
58
59
60
61
62
63
    assertFalse(c.encapsulates());
  }

  @Test
  public void testAddNode() {
    Node n = new Node("c");
    c.addNode(n);
    assertTrue(c.contains(n));
  }
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
    assertTrue(c.contains(n));
  }

  @Test
  public void testRemoveNode() {
    Node n = new Node("c");
    c.addNode(n);
    assertTrue(c.contains(n));

    assertFalse(c.contains(n));
  }
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
    assertFalse(c.contains(n));
  }

  @Test
  public void testContains() {
    Node n = new Node ("c");
    assertFalse(c.contains(n));
    assertTrue(c.contains(a));
    assertTrue(c.contains(b));
    c.addNode(n);
    assertTrue(c.contains(n));
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
35
36
37
  Node outsideOut;
  Node a,b;
  @Before
  public void setUp() throws Exception {
    c = new ClusterNode();
    a = new Node("a");
    b = new Node("b");
    outsideIn = new Node("outside -> in ");
    outsideOut = new Node("cluster -> outside");
    c.addNode(a);
    c.addNode(b);
    outsideIn.connect(a," a ");
    b.connect(outsideOut, " b ");
  }
View Full Code Here
63
64
65
66
67
68
69
70
71
    assertTrue(c.encapsulates());
  }

  @Test
  public void testAddNode() {
    Node n = new Node("c");
    c.addNode(n);
    assertTrue(c.contains(n));
  }
View Full Code Here
70
71
72
73
74
75
76
77
78
79
    assertTrue(c.contains(n));
  }

  @Test
  public void testRemoveNode() {
    Node n = new Node("c");
    c.addNode(n);
    assertTrue(c.contains(n));

  }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
  }

  @Test
  public void testContains() {
    Node n = new Node ("c");
    assertFalse(c.contains(n));
    assertTrue(c.contains(a));
    assertTrue(c.contains(b));
    c.addNode(n);
    assertTrue(c.contains(n));
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
  ClusterHead head;
  Graph g;
  @Before
  public void setUp() throws Exception {
    c = new ClusterNode();
    a = new Node("a");
    b = new Node("b");
    g = new Graph();
    g.addNode(a);
    g.addNode(b);
    outsideIn = new Node("outside -> in ");
    outsideOut = new Node("cluster -> outside");
    c.addNode(a);
    c.addNode(b);
    outsideIn.connect(a," a ");
    b.connect(outsideOut, " b ");
    g.addNode(outsideIn);
View Full Code Here
TOP

Related Classes of primitives.graph.Node

  • gpinterpreter.stack.StackInterpreterTest
  • gpinterpreterTests.GPInterpreterTest
  • primitives.cluster.ClusterHead
  • primitives.cluster.ClusterLeaf
  • primitiveTests.ClusterHeadTest
  • primitiveTests.ClusterNodeTest
  • primitiveTests.ClusterTest
  • primitiveTests.ClusterUtilsTest
  • primitiveTests.GraphTest
  • primitiveTests.UselessTests
    • 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.