最小生成树-Prim算法的Python实现
建立图如果不了解算法思想,请移步 http://c.biancheng.net/algorithm/prim.htmlclass Graph: def __init__(self,vertex_num,edges): # 权重初始化为无穷 self.vertex_num = vertex_num self.edges = np.zeros(shape=(vertex_num,vertex_num),dtype=int) self.ed
原创
2021-10-08 18:26:58 ·
578 阅读 ·
0 评论