def test_create_new_graph(self): vert1 = TestVertex(10, "New AbstractConstrainedVertex 1", 256) vert2 = TestVertex(5, "New AbstractConstrainedVertex 2", 256) vert3 = TestVertex(3, "New AbstractConstrainedVertex 3", 256) edge1 = MultiCastPartitionableEdge(vert1, vert2, None, "First edge") edge2 = MultiCastPartitionableEdge(vert2, vert1, None, "First edge") edge3 = MultiCastPartitionableEdge(vert1, vert3, None, "First edge") verts = [vert1, vert2, vert3] edges = [edge1, edge2, edge3] graph = PartitionableGraph("Graph", verts, edges) for i in range(3): self.assertEqual(graph.vertices[i], verts[i]) self.assertEqual(graph.edges[i], edges[i]) oev = graph.outgoing_edges_from_vertex(vert1) if edge2 in oev: raise AssertionError("edge2 is in outgoing_edges_from vert1") iev = graph.incoming_edges_to_vertex(vert1) if edge1 in iev or edge3 in iev: raise AssertionError( "edge1 or edge3 is in incoming_edges_to vert1")