Networkx -获取Dijkstra路径中的边缘属性

import networkx as nx

G = nx.Graph()  # 创建一个无向图

G.add_edge('A', 'B', weight=4, distance=10)  # 添加一条连接'A'和'B'的边，设置权重和距离属性
G.add_edge('B', 'C', weight=2, distance=5)
G.add_edge('A', 'C', weight=6, distance=15)

path = nx.dijkstra_path(G, 'A', 'C')  # 计算从节点'A'到节点'C'的最短路径

for i in range(len(path)-1):
    source = path[i]
    target = path[i+1]
    edge_data = G.get_edge_data(source, target)  # 获取边缘属性
    weight = edge_data['weight']  # 获取权重属性
    distance = edge_data['distance']  # 获取距离属性
    print(f"Edge from {source} to {target}: weight={weight}, distance={distance}")