networkx中给定最短路径计算出总长度

import networkx as nx
import matplotlib.pyplot as plt

G = nx.read_weighted_edgelist(‘E:/Python-code/weight.edgelist’)

get_nodes_weight = G.get_edge_data(‘1’, ‘2’)
print(get_nodes_weight)
p1 = nx.shortest_path(G, source=‘1’, target=‘9’)
print(p1)
distance = []
for i in range(len(p1)-1):
get_nodes_weight = G.get_edge_data(p1[i], p1[i+1])
print(get_nodes_weight)
weight = get_nodes_weight[‘weight’]
distance.append(weight)
print(distance)
“”"
1 2 0.6
1 3 0.2
3 4 0.1
3 5 0.7
3 6 0.9
1 4 0.3
“”"
sum_path = sum(distance)
print(sum_path)

{‘weight’: 2606.0}
[‘1’, ‘2’, ‘3’, ‘4’, ‘5’, ‘6’, ‘7’, ‘8’, ‘9’]
{‘weight’: 2606.0}
{‘weight’: 1921.0}
{‘weight’: 1953.0}
{‘weight’: 1479.0}
{‘weight’: 1810.0}
{‘weight’: 1778.0}
{‘weight’: 1313.0}
{‘weight’: 1172.0}
[2606.0, 1921.0, 1953.0, 1479.0, 1810.0, 1778.0, 1313.0, 1172.0]
14032.0