python利用kruskal求解最短路径的问题

python利用kruskal算法求解最短路径的问题，修改参数后可以直接使用

 def kruskal():
     """
     kruskal 算法
     """
     dimensional = get_array(9999) # 获取数组
     node_num = len(dimensional)
     res = []
     count = 0
     # 获取节点值
     for i in range(node_num):
         for j in range(i):
             if 0 < dimensional[i][j] < 9999:
                 count += 1
     # 临界值判断
     if node_num <= 0 or count < node_num - 1:
         return res
     res = []
     selected_node = [0]
     candidate_node = [i for i in range(1, node_num)]
     # 终止条件判断
     while len(candidate_node) > 0:
         begin, end, min_weight = 0, 0, 9999
         for i in selected_node:
             for j in candidate_node:
                 if dimensional[i][j] < min_weight:
                     min_weight = dimensional[i][j]
                     begin = i
                     end = j
         res.append([begin, end, min_weight])
         selected_node.append(end)
         candidate_node.remove(end)
     return res