def get_cycle_graph(): a = Node(1) b = Node(2) c = Node(3, [b]) d = Node(5, [c, a]) e = Node(6, [d]) a.add_neighbor(e) return e
def test_add_neighbor(): first = Node(2) second = Node(3) third = Node(4) node = Node(5) node.add_neighbor(first) node.add_neighbor(second) node.add_neighbor(third) expected_neighbors = [first, second, third] assert node.neighbors == expected_neighbors