使用python返回无向路径图

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

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

start_node = 'A'
end_node = 'E'
paths = dfs(graph, start_node, end_node)
for path in paths:
    print(' -> '.join(path))

A -> B -> D -> E
A -> C -> E