Exemplo n.º 1
0
def test_cyclic_graph_no_path():
    graph = Graph()
    nodes = [["a","b"],["b","a"],["c"]]
    graph.make_unweighted_from_list(nodes)
    expected_path = []
    actual_path = graph.depth_first_search(start=Node("a"), target=Node("c"))
    assert actual_path == expected_path