Dijkstra算法

import matplotlib.pyplot as plt
import networkx as nx
G1=nx.Graph()# 创建空的无向图
G1.add_weighted_edges_from([(1,2,2),(1,3,8),(1,4,1),
                            (2,3,6),(2,3,1),
                            (3,4,7),(3,3,3),(3,6,1),(3,7,2),
                            (4,7,9),
                            (3,6,3),(3,8,2),(3,9,9),
                            (6,7,4),(6,9,6),
                            (7,9,3),(7,10,1),
                            (8,9,7),(8,11,9),
                            (9,10,1),(9,11,2),
                            (10,11,4)])#向图中添加多条赋权边: (node1,node2,weight)
print('nx.info:',G1.nodes)
#两个指定顶点之间的最短加权路径
minWPath_v1_v11=nx.dijkstra_path(G1,source=1,target=11)# 顶点1到顶点11的最短加权路径
print("顶点 v1 到 顶点 v11 的最短加权路径: ",minWPath_v1_v11)
#两个指定顶点之间的最短加权路径的长度
lMinWPath_v1_v11=nx.dijkstra_path_length(G1,source=1,target=11)#最短加权路径长度
print("顶点 v1 到 顶点 v11 的最短加权路径长度: ",lMinWPath_v1_v11)
pos={1:(0,4),2:(5,7),3:(5,4),4:(5,1),5:(10,7),6:(10,4),7: (10,1),8:(15,7),9:(15,4),10:(15,1),11: (20,4)}# 指定顶点位置
labels=nx.get_edge_attributes(G1,'weight')#设置边的labels为weight
nx.draw(G1,pos,with_labels=True,font_color='w')#绘制无向图
nx.draw_networkx_edge_labels(G1,pos,edge_labels=labels,font_color='#ffc0cb')#边的权值
plt.show()