bianxia123456的博客

一、画图、Dijkstra最短路径 import networkx as nx import matplotlib.pyplot as plt G = nx.Graph() # topology construction logic G.add_node('s1', desc='s1') G.add_node('s2', desc='s2') G.add_node('s3', desc='s3') G.add_node('s4', desc='s4') e = [('s1', 's2', 0.3), ('