','v10'),('v8','v11'),('v8','v12'),('v8','v13'),('v8','v14'),('v8','v15'),
23 ('v9','v10'...','v10'),('v8','v11'),('v8','v12'),('v8','v13'),('v8','v14'),('v8','v15'),
23 ('v9','v10'...'),('v1', 'v9'),
17 ('v2', 'v5'), ('v2', 'v6'), ('v2', 'v7'),('v2', 'v8'),('v2', 'v9'),...','v10'),('v8','v11'),('v8','v12'),('v8','v13'),('v8','v14'),('v8','v15'),
24 ('v9','v10..., 6, 7]
8dijkstra方法寻找最短距离:
9节点0到7的距离为: 9
问题
本人在pycharm中运行下列程序:
1import networkx as nx
2import matplotlib.pyplot