Examples of AdjacencyMatrixEdge


Examples of org.openjgraph.model.adjacencymatrix.AdjacencyMatrixEdge

            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")));
           

        } catch (VertexNotFoundException ex) {
            assertFalse(true);
        }
View Full Code Here

Examples of org.openjgraph.model.adjacencymatrix.AdjacencyMatrixEdge

            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());

        } catch (VertexNotFoundException ex) {
            assertFalse(true);
        }
View Full Code Here

Examples of org.openjgraph.model.adjacencymatrix.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");
            AdjacencyMatrixEdge e4 = new AdjacencyMatrixEdge(graph1, "A", "C");

            AdjacencyMatrixEdge e5 = new AdjacencyMatrixEdge(graph1, "A", null);
            AdjacencyMatrixEdge e6 = new AdjacencyMatrixEdge(graph1, "A", null);
            AdjacencyMatrixEdge e7 = new AdjacencyMatrixEdge(graph1, "B", null);
            AdjacencyMatrixEdge e8 = new AdjacencyMatrixEdge(graph1, null, "B");
            AdjacencyMatrixEdge e9 = new AdjacencyMatrixEdge(graph1, null, "B");
            AdjacencyMatrixEdge e10 = new AdjacencyMatrixEdge(graph1, null, "A");
            AdjacencyMatrixEdge e11 = new AdjacencyMatrixEdge(graph1, null, "A");
            AdjacencyMatrixEdge e12 = new AdjacencyMatrixEdge(graph1, null, null);
            AdjacencyMatrixEdge e13 = new AdjacencyMatrixEdge(graph1, null, null);

            assertTrue(e1.equals(e2));
            assertTrue(e1.equals(e3));
            assertFalse(e1.equals(e4));
            assertFalse(e1.equals(e5));
            assertFalse(e5.equals(e1));
            assertTrue(e5.equals(e6));
            assertFalse(e5.equals(e7));
            assertTrue(e7.equals(e8));
            assertTrue(e8.equals(e9));
            assertTrue(e10.equals(e11));
            assertTrue(e12.equals(e13));
            assertFalse(e1.equals(e13));
            assertFalse(e13.equals(e1));
            assertFalse(e13.equals(e10));
            assertFalse(e10.equals(e13));
            assertFalse(e7.equals(e13));
            assertFalse(e13.equals(e7));

           

    }
View Full Code Here

Examples of org.openjgraph.model.adjacencymatrix.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");
            AdjacencyMatrixEdge e4 = new AdjacencyMatrixEdge(graph1, "A", "C");

            AdjacencyMatrixEdge e5 = new AdjacencyMatrixEdge(graph1, "A", null);
            AdjacencyMatrixEdge e6 = new AdjacencyMatrixEdge(graph1, "A", null);
            AdjacencyMatrixEdge e7 = new AdjacencyMatrixEdge(graph1, "B", null);
            AdjacencyMatrixEdge e8 = new AdjacencyMatrixEdge(graph1, null, "B");
            AdjacencyMatrixEdge e9 = new AdjacencyMatrixEdge(graph1, null, "B");
            AdjacencyMatrixEdge e10 = new AdjacencyMatrixEdge(graph1, null, "A");
            AdjacencyMatrixEdge e11 = new AdjacencyMatrixEdge(graph1, null, "A");
            AdjacencyMatrixEdge e12 = new AdjacencyMatrixEdge(graph1, null, null);
            AdjacencyMatrixEdge e13 = new AdjacencyMatrixEdge(graph1, null, null);

            assertTrue(e1.hashCode() == e2.hashCode());
            assertTrue(e1.hashCode() == e3.hashCode());
            assertFalse(e1.hashCode() == e4.hashCode());
            assertFalse(e1.hashCode() == e5.hashCode());
            assertFalse(e5.hashCode() == e1.hashCode());
            assertTrue(e5.hashCode() == e6.hashCode());
            assertFalse(e5.hashCode() == e7.hashCode());
            assertTrue(e7.hashCode() == e8.hashCode());
            assertTrue(e8.hashCode() == e9.hashCode());
            assertTrue(e10.hashCode() == e11.hashCode());
            assertTrue(e12.hashCode() == e13.hashCode());
            assertFalse(e1.hashCode() == e13.hashCode());
            assertFalse(e13.hashCode() == e1.hashCode());
            assertFalse(e13.hashCode() == e10.hashCode());
            assertFalse(e10.hashCode() == e13.hashCode());
            assertFalse(e7.hashCode() == e13.hashCode());
            assertFalse(e13.hashCode() == e7.hashCode());

    }
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.