試圖找到從起始頂點(diǎn)到結(jié)束頂點(diǎn)的所有可能路徑。這是我到目前為止。def all_paths(adj_list, source, destination):paths = []for neighbour,_ in adj_list[source]:    path = [source,neighbour]    state = ['U'] * len(adj_list)    state[neighbour] = 'D'    path = finder(adj_list, neighbour, state, path, destination)    paths.append(path)return pathsdef finder(adj_list, current, state, path, end):    for neighbour,_ in adj_list[current]:        if neighbour == end:            path.append(neighbour)            return path        if state[neighbour] == 'U':            state[neighbour] = 'D'            path.append(finder(adj_list, neighbour, state, path, end))            return path狀態(tài)數(shù)組是為了確保沒(méi)有頂點(diǎn)被訪問(wèn)兩次（U 未被發(fā)現(xiàn)，D 被發(fā)現(xiàn)）。通過(guò)邊連接到 i （Nones 是所述邊的權(quán)重）輸入是adj_list = [[(1, None), (2, None)], [(0, None), (2, None)], [(1, None), (0, None)]]print(sorted(all_paths(adj_list, 0, 2)))預(yù)期的輸出是[[0, 1, 2], [0, 2]]我的輸出是[[0, 1, 2, [...]], [0, 2, 2, [...], [...]]]不確定我是如何得到這些點(diǎn)和第二條路徑中重復(fù)的 2 的？