使用python创建带有权重的路径图

pip install networkx

import networkx as nx
import matplotlib.pyplot as plt

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

# 添加节点和边，以及边的权重
G.add_edge('A', 'B', weight=4)
G.add_edge('B', 'C', weight=8)
G.add_edge('C', 'D', weight=7)
G.add_edge('D', 'E', weight=1)
G.add_edge('E', 'F', weight=10)
G.add_edge('F', 'G', weight=11)
G.add_edge('G', 'H', weight=6)
G.add_edge('H', 'A', weight=7)

# 使用Dijkstra算法找到最短路径
shortest_path = nx.dijkstra_path(G, source='A', target='H', weight='weight')
print("Shortest path:", shortest_path)

# 绘制图形
pos = nx.spring_layout(G)  # 定义布局方式
nx.draw(G, pos, with_labels=True, node_color='lightblue', edge_color='grey', font_weight='bold', node_size=7000)

# 绘制边的权重
edge_labels = nx.get_edge_attributes(G, 'weight')
nx.draw_networkx_edge_labels(G, pos, edge_labels=edge_labels)

plt.show()