def test_cyclic_no_path_from_start_to_target():
graph = Graph()
nodes = [["a", "b"], ["b", "a"], ["c"]]
graph.make_unweighted_from_list(nodes)
expected_path = []
actual_path = graph.breadth_first_search(start=Node("a"), target=Node("c"))
assert actual_path == expected_path
def test_cyclic_graph_large():
graph = Graph()
nodes = [["a", "b"], ["b", "c"], ["c", "d"], ["d", "e"], ["d", "a"],
["a", "d"], ["e", "z"], ["z", "a"]]
graph.make_unweighted_from_list(nodes)
expected_path = ["a", "d", "e", "z"]
actual_path = graph.breadth_first_search(start=Node("a"), target=Node("z"))
assert actual_path == expected_path
