def test_move_undirected_from_to_emptyset(self):
g = BinaryMixedTree(MixedGraph({1, 2, 3}, [(2, 3), (3, 1)]))
empty_set = set()
g.move_undirected_from_to(3, 1, empty_set)
expected = BinaryMixedTree(MixedGraph({1, 2, 3}, [(2, 3), (3, 1)]))
self.assertEqual(expected, g)
def test_move_undirected(self):
g = BinaryMixedTree(MixedGraph({0, 1, 2, 3, 4}, [(2, 4)]))
g.add(frozenset([2, 3]))
g.update(DIRECTED_EDGE, [(frozenset([2]), frozenset([0])), (frozenset([3]), frozenset([1])),
(frozenset([2]), frozenset([2, 3])), (frozenset([3]), frozenset([2, 3]))],
node_creation=False)
g.move_undirected_from_to(frozenset([2]), frozenset([2, 3]), {frozenset([4])})
expected = BinaryMixedTree(MixedGraph({0, 1, 2, 3, 4}))
expected.add(frozenset([2, 3]))
expected.update(DIRECTED_EDGE, [(frozenset([2]), frozenset([0])), (frozenset([3]), frozenset([1])),
(frozenset([2]), frozenset([2, 3])), (frozenset([3]), frozenset([2, 3]))],
node_creation=False)
expected.add_undirected(frozenset([4]), frozenset([2, 3]))
self.assertEqual(g, expected)