在两个相邻节点之间具有多条边的图中查找所有可能的路径

def find_all_paths_dfs(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:
            new_paths = find_all_paths_dfs(graph, node, end, path)
            for new_path in new_paths:
                paths.append(new_path)
    return paths

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

start_node = 'A'
end_node = 'D'
all_paths = find_all_paths_dfs(graph, start_node, end_node)
print(all_paths)

from collections import deque

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

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

start_node = 'A'
end_node = 'D'
all_paths = find_all_paths_bfs(graph, start_node, end_node)
print(all_paths)