python -以递归方式存储从源到目标的所有路径

def find_all_paths(graph, start, end, path=[]):
    path = path + [start]
    if start == end:
        return [path]
    if start not in graph:
        return []
    paths = []
    for node in graph[start]:
        if node not in path:
            newpaths = find_all_paths(graph, node, end, path)
            for newpath in newpaths:
                paths.append(newpath)
    return paths

# 示例图
graph = {
    'A': ['B', 'C'],
    'B': ['D'],
    'C': ['E'],
    'D': ['E'],
    'E': ['F'],
    'F': []
}

# 查找从 'A' 到 'F' 的所有路径
paths = find_all_paths(graph, 'A', 'F')
print(paths)

import sys
sys.setrecursionlimit(10000)  # 增加栈大小

def find_all_paths(graph, start, end, path=[], memo={}):
    if (start, end) in memo:
        return memo[(start, end)]
    path = path + [start]
    if start == end:
        return [path]
    if start not in graph:
        return []
    paths = []
    for node in graph[start]:
        if node not in path:
            newpaths = find_all_paths(graph, node, end, path, memo)
            for newpath in newpaths:
                paths.append(newpath)
    memo[(start, end)] = paths
    return paths