Examples of removeEdge()

Examples of bgu.bio.adt.graphs.FlexibleGraph.removeEdge()

48
49
50
51
52
53
54
55
56
57
58
    graph.addEdge(0, 4);
    graph.addEdge(0, 3);
    graph.addEdge(3, 2);
    graph.addEdge(5, 3);
    Assert.assertEquals("wrong number of incoming edges", 3, graph.inDeg(3));
    graph.removeEdge(6, 3);
    Assert.assertEquals("wrong number of leaves", 4,
        graph.getNumberOfLeaves());
    Assert.assertEquals("wrong maximal out degree", 3, graph.getMaxOutDeg());
    Assert.assertEquals("wrong number of edges", 5, graph.getEdgeNum());
View Full Code Here

Examples of com.evelopers.unimod.glayout.graph.SimpleGraph.removeEdge()

52
53
54
55
56
57
58
59
60
61
62
        public void removeEdge(SimpleEdge e) {
            ListIterator li = graphs.listIterator();

            while (li.hasNext()) {
                SimpleGraph graph = (SimpleGraph) li.next();
                graph.removeEdge(e);
            }
        }

        public void addEdge(SimpleEdge e) {
            ListIterator li = graphs.listIterator();
View Full Code Here

Examples of com.sun.hotspot.igv.data.InputGraph.removeEdge()

157
158
159
160
161
162
163
164
165
166
167
                markAsDeleted(newEdge);
                newEdges.add(newEdge);
                graph.addEdge(newEdge);
            } else {
                newEdges.remove(newEdge);
                graph.removeEdge(newEdge);
                markAsSame(newEdge);
                newEdges.add(newEdge);
                graph.addEdge(newEdge);
            }
        }
View Full Code Here

Examples of com.tinkerpop.blueprints.Graph.removeEdge()

54
55
56
57
58
59
60
61
62
63
64
            assertTrue(false);
        } catch (UnsupportedOperationException e) {
            assertTrue(true);
        }
        try {
            graph.removeEdge(graph.getEdge(10));
            assertTrue(false);
        } catch (UnsupportedOperationException e) {
            assertTrue(true);
        }
        try {
View Full Code Here

Examples of com.tinkerpop.blueprints.KeyIndexableGraph.removeEdge()

211
212
213
214
215
216
217
218
219
220
221
            }
            if (graph.getFeatures().supportsVertexIteration) assertEquals(count(graph.getVertices()), 50);
            if (graph.getFeatures().supportsEdgeIteration) assertEquals(count(graph.getEdges()), 25);
            int counter = 0;
            for (final Edge edge : graph.getEdges("key", "value")) {
                graph.removeEdge(edge);
                counter++;
            }
            assertEquals(counter, 25);
            if (graph.getFeatures().supportsVertexIteration) assertEquals(count(graph.getVertices()), 50);
            if (graph.getFeatures().supportsEdgeIteration) assertEquals(count(graph.getEdges()), 0);
View Full Code Here

Examples of com.tinkerpop.blueprints.impls.orient.OrientBaseGraph.removeEdge()

472
473
474
475
476
477
478
479
480
481
482
    Orient.instance().getWorkers().submit(new Callable<Object>() {
      @Override
      public Object call() throws Exception {
        final OrientBaseGraph g = acquire();
        try {
          g.removeEdge(edge);
        } finally {
          g.shutdown();
          endAsynchOperation();
        }
        return null;
View Full Code Here

Examples of de.timefinder.algo.graph.WeightedGraph.removeEdge()

40
41
42
43
44
45
46
47
48
49
50
        graph.addEdge(2, 4, 9f);

        assertEquals(2, graph.getNoOfEdges());
        assertTrue(graph.getNeighbors(4).containsValue(8f));

        boolean ret = graph.removeEdge(3, 4);
        assertTrue(ret);
        assertEquals(1, graph.getNoOfEdges());

        ret = graph.removeEdge(3, 4);
        assertFalse(ret);
View Full Code Here

Examples of de.timefinder.algo.graph.WeightedGraph.removeEdge()

44
45
46
47
48
49
50
51
52
53
54
        boolean ret = graph.removeEdge(3, 4);
        assertTrue(ret);
        assertEquals(1, graph.getNoOfEdges());

        ret = graph.removeEdge(3, 4);
        assertFalse(ret);
        assertEquals(1, graph.getNoOfEdges());
    }

    /**
 
View Full Code Here

Examples of de.timefinder.algo.graph.WeightedGraph.removeEdge()

78
79
80
81
82
83
84
85
86
87
88
        graph.addEdge(3, 4, 7f);
        graph.addEdge(2, 4, 7f);

        assertTrue(graph.getOneNodeWithAnEdge() != -1);

        graph.removeEdge(3, 4);
        assertTrue(graph.getOneNodeWithAnEdge() != -1);

        graph.removeEdge(2, 4);
        assertTrue(graph.getOneNodeWithAnEdge() == -1);
    }
View Full Code Here

Examples of de.timefinder.algo.graph.WeightedGraph.removeEdge()

81
82
83
84
85
86
87
88
89
90
91
        assertTrue(graph.getOneNodeWithAnEdge() != -1);

        graph.removeEdge(3, 4);
        assertTrue(graph.getOneNodeWithAnEdge() != -1);

        graph.removeEdge(2, 4);
        assertTrue(graph.getOneNodeWithAnEdge() == -1);
    }

    /**
     * Test of removeNodeAndNeighbors method, of class WeightedGraph.
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.