Package org.openjgraph.model.adjacencymatrix

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

42
43
44
45
46
47
48
49
50
51
52
            AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph();
            AdjacencyMatrixVertex v1 = new AdjacencyMatrixVertex(graph, "A");
            AdjacencyMatrixVertex v2 = new AdjacencyMatrixVertex(graph, "B");
            AdjacencyMatrixVertex v3 = new AdjacencyMatrixVertex(graph, "C");
            AdjacencyMatrixVertex v4 = new AdjacencyMatrixVertex(graph, "D");
            graph.addVertex("A");
            graph.addVertex("B");
            graph.addVertex("C");
            graph.addVertex("D");
            graph.addEdge("A", "B");
            graph.addEdge("A", "C");
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
            AdjacencyMatrixVertex v1 = new AdjacencyMatrixVertex(graph, "A");
            AdjacencyMatrixVertex v2 = new AdjacencyMatrixVertex(graph, "B");
            AdjacencyMatrixVertex v3 = new AdjacencyMatrixVertex(graph, "C");
            AdjacencyMatrixVertex v4 = new AdjacencyMatrixVertex(graph, "D");
            graph.addVertex("A");
            graph.addVertex("B");
            graph.addVertex("C");
            graph.addVertex("D");
            graph.addEdge("A", "B");
            graph.addEdge("A", "C");
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
            AdjacencyMatrixVertex v2 = new AdjacencyMatrixVertex(graph, "B");
            AdjacencyMatrixVertex v3 = new AdjacencyMatrixVertex(graph, "C");
            AdjacencyMatrixVertex v4 = new AdjacencyMatrixVertex(graph, "D");
            graph.addVertex("A");
            graph.addVertex("B");
            graph.addVertex("C");
            graph.addVertex("D");
            graph.addEdge("A", "B");
            graph.addEdge("A", "C");

            Set<Edge> edgeSet = v1.getEdges();
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
            AdjacencyMatrixVertex v3 = new AdjacencyMatrixVertex(graph, "C");
            AdjacencyMatrixVertex v4 = new AdjacencyMatrixVertex(graph, "D");
            graph.addVertex("A");
            graph.addVertex("B");
            graph.addVertex("C");
            graph.addVertex("D");
            graph.addEdge("A", "B");
            graph.addEdge("A", "C");

            Set<Edge> edgeSet = v1.getEdges();
            assertEquals(2, edgeSet.size());
View Full Code Here
197
198
199
200
201
202
203
204
205
206
207
    public void testGetVertex1() {

        AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph(5);

        graph.addVertex("A");
        graph.addVertex("B");
        graph.addVertex("C");
        graph.addVertex("D");
        graph.addVertex("E");
View Full Code Here
198
199
200
201
202
203
204
205
206
207
208
    public void testGetVertex1() {

        AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph(5);

        graph.addVertex("A");
        graph.addVertex("B");
        graph.addVertex("C");
        graph.addVertex("D");
        graph.addVertex("E");

        try {
View Full Code Here
199
200
201
202
203
204
205
206
207
208
209
        AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph(5);

        graph.addVertex("A");
        graph.addVertex("B");
        graph.addVertex("C");
        graph.addVertex("D");
        graph.addVertex("E");

        try {
            graph.addEdge("A", "B");
View Full Code Here
200
201
202
203
204
205
206
207
208
209
210
        AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph(5);

        graph.addVertex("A");
        graph.addVertex("B");
        graph.addVertex("C");
        graph.addVertex("D");
        graph.addVertex("E");

        try {
            graph.addEdge("A", "B");
            graph.addEdge("A", "C");
View Full Code Here
201
202
203
204
205
206
207
208
209
210
211
        graph.addVertex("A");
        graph.addVertex("B");
        graph.addVertex("C");
        graph.addVertex("D");
        graph.addVertex("E");

        try {
            graph.addEdge("A", "B");
            graph.addEdge("A", "C");
            graph.addEdge("B", "C");
View Full Code Here
324
325
326
327
328
329
330
331
332
333
334
                    assertTrue("Impossible d'ajouter l'arete (" + i + "," + j +")",false);
                }
            }
        }

        graph.addVertex("11");
       
        Set<Vertex> newVertexSet = graph.getVertexSet();
        assertEquals(11, newVertexSet.size());
    }
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.