如何从一个节点查找所有路径

def find_all_paths(graph, start, end):
    paths = []
    dfs(graph, start, end, [start], paths)
    return paths

def dfs(graph, current, end, path, paths):
    if current == end:
        paths.append(path.copy())
    else:
        for neighbor in graph[current]:
            if neighbor not in path:
                path.append(neighbor)
                dfs(graph, neighbor, end, path, paths)
                path.remove(neighbor)

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

start = 'A'
end = 'D'
all_paths = find_all_paths(graph, start, end)
print(all_paths)