@@ -11,8 +11,8 @@ def __init__(self, nodes, edges) -> None:
11
11
12
12
def shortest_path (self , start_node ):
13
13
num_node = len (self .nodes )
14
- parent = [None ] * num_node # 记录路径,初始化全为: None
15
- distance = [None ] * num_node # 初始化最短距离全为: None
14
+ parent = [None ] * num_node # 记录路径,初始化全为: None
15
+ distance = [None ] * num_node # 初始化最短距离全为: None
16
16
edge_weight = defaultdict (lambda : None ) # 边和权重映射
17
17
node_neighbors = defaultdict (set ) # 节点和其邻居映射
18
18
# 初始化
@@ -25,7 +25,6 @@ def shortest_path(self, start_node):
25
25
for neighbor in node_neighbors [start_node ]:
26
26
parent [neighbor ] = start_node
27
27
distance [neighbor ] = edge_weight [(start_node , neighbor )]
28
-
29
28
not_visit = [_ for _ in range (num_node ) if _ != start_node ] # 还没有访问的节点
30
29
31
30
while len (not_visit ):
@@ -111,7 +110,7 @@ def draw(DG, color_nodes, color_edges):
111
110
edge_labels = nx .get_edge_attributes (DG , 'weight' )
112
111
# edge_labels = { (key[0],key[1]): "w:"+str(edge_labels[key]) for key in edge_labels }
113
112
nx .draw_networkx_edge_labels (DG , pos , edge_labels = edge_labels ) # 画权重
114
- # plt.savefig('dijkstra.png', format='PNG')
113
+ plt .savefig ('dijkstra.png' , format = 'PNG' )
115
114
plt .show ()
116
115
117
116
0 commit comments