Examples of addVertex()

Examples of org.openjgraph.model.Graph.addVertex()

49
50
51
52
53
54
55
56
57
58
59
        }

        BudgetGraphComparator comparator = new BudgetGraphComparator();
        Graph solvedGraph = new AdjacencyMatrixDirectedGraph(graph.getVertexSet().size());
        for( Vertex v : graph.getVertexSet()) {
            solvedGraph.addVertex(v.getId());
        }

        while( (!positivesDegree.isEmpty()) && (!negativesDegree.isEmpty())) {

            // on tri les deux listes de vertex
View Full Code Here

Examples of org.openjgraph.model.adjacencymatrix.AdjacencyMatrixDirectedGraph.addVertex()

49
50
51
52
53
54
55
56
57
58
59
        }

        BudgetGraphComparator comparator = new BudgetGraphComparator();
        Graph solvedGraph = new AdjacencyMatrixDirectedGraph(graph.getVertexSet().size());
        for( Vertex v : graph.getVertexSet()) {
            solvedGraph.addVertex(v.getId());
        }

        while( (!positivesDegree.isEmpty()) && (!negativesDegree.isEmpty())) {

            // on tri les deux listes de vertex
View Full Code Here

Examples of org.openjgraph.model.adjacencymatrix.AdjacencyMatrixGraph.addVertex()

38
39
40
41
42
43
44
45
46
47
48
     * Test of getVertex method, of class AdjacencyMatrixEdge.
     */
    public void testGetVertex() {
        try {
            AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph();
            graph.addVertex("A");
            graph.addVertex("B");
            graph.addVertex("C");
            graph.addVertex("D");
            graph.addEdge("A", "B", 5);
            graph.addEdge("A", "C", 4);
View Full Code Here

Examples of org.openntf.domino.graph.DominoGraph.addVertex()

28
29
30
31
32
33
34
35
36
37
38
      long start = System.nanoTime();
      Session s = Factory.getSessionFullAccess();
      Database db = s.getDatabase(server, dbPath);
      DominoGraph graph = new DominoGraph(db);
      for (int i = 1; i <= 10000; i++) {
        Vertex v1 = graph.addVertex(null);
        v1.setProperty("Test1", i);

        Vertex v2 = graph.addVertex(null);
        v2.setProperty("Test1", i);
View Full Code Here

Examples of org.opentripplanner.common.geometry.Subgraph.addVertex()

200
201
202
203
204
205
206
207
208
209
210
        q.add(startVertex);
        while (!q.isEmpty()) {
            Vertex vertex = q.poll();
            for (Vertex neighbor : neighborsForVertex.get(vertex)) {
                if (!subgraph.contains(neighbor)) {
                    subgraph.addVertex(neighbor);
                    q.add(neighbor);
                }
            }
        }
        return subgraph;
View Full Code Here

Examples of ru.spbu.math.ontologycomparison.zhukova.visualisation.model.IGraphModel.addVertex()

110
111
112
113
114
115
116
117
118
119
120
                    SuperVertex superVertex = simpleVertex.getSuperVertex();
                    IVertex vertex = superVertex == null ? simpleVertex : superVertex;
                    if (hide) {
                        graphModel.removeVertex(vertex);
                    } else {
                        graphModel.addVertex(vertex);
                    }
                    for (IOntologyConcept similarConcept : ontologyConcept.getSimilarConcepts()) {
                        Set<CheckNode> similarNodes = conceptToCheckNodeMap.get(similarConcept);
                        if (similarNodes != null) {
                            for (CheckNode similar : similarNodes) {
View Full Code Here

Examples of statechum.analysis.learning.linear.GD.ChangesRecorder.addVertex()

877
878
879
880
881
882
883
884
885
886
887
    patcher.addRelabelling(VertexID.parseID("A"), VertexID.parseID("U"));
    patcher.addRelabelling(VertexID.parseID("C"), VertexID.parseID("R"));
   
    CmpVertex danglingVertex = AbstractLearnerGraph.generateNewCmpVertex(VertexID.parseID("TEST"), cloneConfig);
    danglingVertex.setColour(JUConstants.BLUE);
    patcher.addVertex(danglingVertex);
    Configuration config = Configuration.getDefaultConfiguration().copy();config.setLearnerCloneGraph(false);
    LearnerGraphMutator<List<CmpVertex>,LearnerGraphNDCachedData> graphPatcher = new LearnerGraphMutator<List<CmpVertex>,LearnerGraphNDCachedData>(graph,config,null);
    ChangesRecorder.loadDiff(graphPatcher, patcher.writeGD(createDoc()));
    graphPatcher.removeDanglingStates();
    LearnerGraphND result = new LearnerGraphND(Configuration.getDefaultConfiguration());
View Full Code Here

Examples of statechum.analysis.learning.rpnicore.GD.ChangesRecorder.addVertex()

850
851
852
853
854
855
856
857
858
859
860
    patcher.addRelabelling(VertexID.parseID("A"), VertexID.parseID("U"));
    patcher.addRelabelling(VertexID.parseID("C"), VertexID.parseID("R"));
   
    CmpVertex danglingVertex = AbstractLearnerGraph.generateNewCmpVertex(VertexID.parseID("TEST"), cloneConfig);
    danglingVertex.setColour(JUConstants.BLUE);
    patcher.addVertex(danglingVertex);
    Configuration config = Configuration.getDefaultConfiguration().copy();config.setLearnerCloneGraph(false);
    LearnerGraphMutator<List<CmpVertex>,LearnerGraphNDCachedData> graphPatcher = new LearnerGraphMutator<List<CmpVertex>,LearnerGraphNDCachedData>(graph,config,null);
    ChangesRecorder.loadDiff(graphPatcher, patcher.writeGD(createDoc()));
    graphPatcher.removeDanglingStates();
    LearnerGraphND result = new LearnerGraphND(Configuration.getDefaultConfiguration());
View Full Code Here

Examples of statechum.analysis.learning.rpnicore.LearnerGraphND.addVertex()

1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
  {
    final LearnerGraph fsm = FsmParser.buildLearnerGraph("A-a->B-b->C", "testTracePath1",config,converter);
    LearnerGraphND ndFSM = new LearnerGraphND(fsm,config);
    synchronized(AbstractLearnerGraph.syncObj)
    {
      ndFSM.addVertex(ndFSM.addVertex(fsm.findVertex("A"), true, lblA),true,lblA);
    }
    Assert.assertTrue(MarkovClassifier.tracePath(ndFSM,AbstractLearnerGraph.buildList(Arrays.asList(new String[]{}),config,converter),fsm.findVertex("A")));
    Assert.assertTrue(MarkovClassifier.tracePath(ndFSM,AbstractLearnerGraph.buildList(Arrays.asList(new String[]{"a","b"}),config,converter),fsm.findVertex("A")));
    Assert.assertTrue(MarkovClassifier.tracePath(ndFSM,AbstractLearnerGraph.buildList(Arrays.asList(new String[]{"a","a"}),config,converter),fsm.findVertex("A")));
  }
View Full Code Here

Examples of wecui.obfuscation.RenderObfuscation.addVertex()

47
48
49
50
51
52
53
54
55
56
57
            z = z2;
            y = y1;
            int msize = 150;
            if ((y2 - y / offsetSize) < msize) {
                for (double yoff = 0; yoff + y <= y2; yoff += offsetSize) {
                    o.addVertex(x1, y + yoff, z);
                    o.addVertex(x2, y + yoff, z);
                }
            }

            // Zmin XY plane, y axis
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.