Python -如何从该networkx代码中提取所有最短路径？

import networkx as nx

# 创建一个有向图
G = nx.DiGraph()

# 添加节点
G.add_nodes_from([1, 2, 3, 4, 5])

# 添加边
G.add_edges_from([(1, 2), (1, 3), (2, 4), (3, 4), (3, 5), (4, 5)])

# 提取所有最短路径
shortest_paths = nx.shortest_path(G, source=1, target=5)

# 打印最短路径
for target, path in shortest_paths.items():
    print(f"最短路径到节点 {target}：{path}")

最短路径到节点 5：[1, 3, 5]