Package org.openjgraph.model.adjacencymatrix

Examples of org.openjgraph.model.adjacencymatrix.AdjacencyMatrixGraph

37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
    /**
     * 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);
            graph.addEdge("B", "C", 10);

            Set<Edge> edgeSet = graph.getEdge("A");
            assertEquals(2,edgeSet.size());
            assertTrue(edgeSet.contains(new AdjacencyMatrixEdge(graph,"A", "B")));
            assertTrue(edgeSet.contains(new AdjacencyMatrixEdge(graph,"A", "C")));
            assertFalse(edgeSet.contains(new AdjacencyMatrixEdge(graph,"B", "C")));
           
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
    /**
     * Test of getValue method, of class AdjacencyMatrixEdge.
     */
    public void testGetValue() {
        try {
            AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph();
            graph.addVertex("A");
            graph.addVertex("B");
            graph.addVertex("C");
            graph.addEdge("A", "B", 5);
            graph.addEdge("A", "C", 4);
            graph.addEdge("B", "C", 10);

            assertEquals(5, graph.getEdgeValue("A", "B"));
            assertEquals(4, graph.getEdgeValue("A", "C"));
            assertEquals(10, graph.getEdgeValue("B", "C"));

        } catch (VertexNotFoundException ex) {
            assertFalse(true);
        }

View Full Code Here
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
    /**
     * Test of toString method, of class AdjacencyMatrixEdge.
     */
    public void testToString() {
        try {
            AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph();
            graph.addVertex("A");
            graph.addVertex("B");
            graph.addVertex("C");
            graph.addEdge("A", "B");
            graph.addEdge("A", "C", 4);
            AdjacencyMatrixEdge e1 = new AdjacencyMatrixEdge(graph, "A", "B");
            AdjacencyMatrixEdge e2 = new AdjacencyMatrixEdge(graph, "A", "C");
            assertEquals("A -[1]- B", e1.toString());
            assertEquals("A -[4]- C", e2.toString());

View Full Code Here
111
112
113
114
115
116
117
118
119
120
121
    /**
     * Test of equals method, of class AdjacencyMatrixEdge.
     */
    public void testEquals() {
            AdjacencyMatrixGraph graph1 = new AdjacencyMatrixGraph();
         //   AdjacencyMatrixGraph graph2 = new AdjacencyMatrixDirectedGraph();

            AdjacencyMatrixEdge e1 = new AdjacencyMatrixEdge(graph1, "A", "B");
            AdjacencyMatrixEdge e2 = new AdjacencyMatrixEdge(graph1, "A", "B");
            AdjacencyMatrixEdge e3 = new AdjacencyMatrixEdge(graph1, "B", "A");
View Full Code Here
155
156
157
158
159
160
161
162
163
164
165
    /**
     * Test of hashCode method, of class AdjacencyMatrixEdge.
     */
    public void testHashCode() {
           AdjacencyMatrixGraph graph1 = new AdjacencyMatrixGraph();
         //   AdjacencyMatrixGraph graph2 = new AdjacencyMatrixDirectedGraph();

            AdjacencyMatrixEdge e1 = new AdjacencyMatrixEdge(graph1, "A", "B");
            AdjacencyMatrixEdge e2 = new AdjacencyMatrixEdge(graph1, "A", "B");
            AdjacencyMatrixEdge e3 = new AdjacencyMatrixEdge(graph1, "B", "A");
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
    /**
     * Test of getEdges method, of class AdjacencyMatrixVertex.
     */
    public void testGetEdges1() {
        try {
            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");

            Set<Edge> edgeSet = v1.getEdges();
            assertEquals(2, edgeSet.size());

            boolean containsV2 = false;
View Full Code Here
86
87
88
89
90
91
92
93
94
95
    /**
     * Test of getId method, of class AdjacencyMatrixVertex.
     */
    public void testGetId() {
        AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph();
        AdjacencyMatrixVertex vertex = new AdjacencyMatrixVertex(graph, "id");

        assertEquals("id", vertex.getId());
    }
View Full Code Here
96
97
98
99
100
101
102
103
104
105
    /**
     * Test of toString method, of class AdjacencyMatrixVertex.
     */
    public void testToString() {
        AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph();
        AdjacencyMatrixVertex vertex = new AdjacencyMatrixVertex(graph, "id");

        assertEquals("id", vertex.toString());
    }
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
    /**
     * Test of equals method, of class AdjacencyMatrixVertex.
     */
    public void testEquals() {
        AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph();
        AdjacencyMatrixVertex v1 = new AdjacencyMatrixVertex(graph, "id");
        AdjacencyMatrixVertex v2 = new AdjacencyMatrixVertex(graph, "id");
        AdjacencyMatrixVertex v3 = new AdjacencyMatrixVertex(graph, "id2");
        AdjacencyMatrixVertex v4 = new AdjacencyMatrixVertex(graph, null);
        AdjacencyMatrixVertex v5 = new AdjacencyMatrixVertex(graph, null);
View Full Code Here
130
131
132
133
134
135
136
137
138
139
140
    /**
     * Test of hashCode method, of class AdjacencyMatrixVertex.
     */
    public void testHashCode() {

        AdjacencyMatrixGraph graph = new AdjacencyMatrixGraph();
        AdjacencyMatrixVertex v1 = new AdjacencyMatrixVertex(graph, "id");
        AdjacencyMatrixVertex v2 = new AdjacencyMatrixVertex(graph, "id");
        AdjacencyMatrixVertex v3 = new AdjacencyMatrixVertex(graph, "id2");
        AdjacencyMatrixVertex v4 = new AdjacencyMatrixVertex(graph, null);
        AdjacencyMatrixVertex v5 = new AdjacencyMatrixVertex(graph, null);
View Full Code Here
TOP

Related Classes of org.openjgraph.model.adjacencymatrix.AdjacencyMatrixGraph

  • org.openjgraph.model.adjencymatrix.AdjacencyMatrixEdgeTest
  • org.openjgraph.model.adjencymatrix.AdjacencyMatrixGraphTest
  • org.openjgraph.model.adjencymatrix.AdjacencyMatrixVertexTest
  • java.util.HashSet
  • org.openjgraph.model.VertexNotFoundException
    • 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.