def test_delete_corrupted(self): """ a b ___ / / \ 1 A,B C |/ | 2 D --- E """ A = Vertex(domain=(1,'a')) B = Vertex(domain=(1,'a')) D = Vertex(domain=(2,'a')) C = Vertex(domain=(1,'b')) E = Vertex(domain=(2,'b')) AD = Edge(A, D) AC = Edge(A, C) BC = Edge(B, C) BD = Edge(B, D) DE = Edge(D, E) CE = Edge(C, E) g = Graph([A, B, C, D, E], [AD, AC, BC, BD, DE, CE]) g.prepare() self.assertItemsEqual(g.get_vertices(), [A, B, C, D, E]) self.assertItemsEqual(g.get_edges(), [AD, AC, BC, BD, DE, CE]) g.delete_edge(BD, True) g.delete_corrupted() self.assertItemsEqual(g.get_vertices(), [A, C, D, E]) self.assertItemsEqual(g.get_edges(), [AD, AC, DE, CE]) self.assertFalse(g.is_neighborhood_corrupted())
def test_delete_edge(self): """ a - b ----- B \ C """ v_aB = Vertex(domain='a') v_bC = Vertex(domain='b') e_aB_bC = Edge(v_aB, v_bC) g = Graph([v_aB, v_bC], [e_aB_bC]) g.prepare() g.delete_edge(e_aB_bC) self.assertItemsEqual(g.get_edges(), []) self.assertItemsEqual(g.get_vertices(), []) self.assertTrue(g.is_neighborhood_corrupted()) """