如何求有圈有向图中两点的所有路径

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:
            new_paths = find_all_paths(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(graph, start_node, end_node)

# 打印所有路径
for path in all_paths:
    print(' -> '.join(path))