查找图中至顶点之间的所有路径

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

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

from collections import deque

def bfs(graph, start, end):
    queue = deque([(start, [start])])
    paths = []
    while queue:
        vertex, path = queue.popleft()
        if vertex == end:
            paths.append(path)
        else:
            for neighbor in graph[vertex]:
                if neighbor not in path:
                    queue.append((neighbor, path + [neighbor]))
    return paths

def find_all_paths(graph, start, end):
    paths = bfs(graph, start, end)
    return paths

graph = {
    'A': ['B', 'C'],
    'B': ['A', 'C', 'D'],
    'C': ['A', 'B', 'D', 'E'],
    'D': ['B', 'C', 'E', 'F'],
    'E': ['C', 'D'],
    'F': ['D']
}