python
qq_37589983
这个作者很懒,什么都没留下…
展开
-
python之克鲁斯卡尔算法
在csp模拟考试上提交超时,不知道是否正确,请大家指正 def isTong(l, n, m): mark = n * [0] mark[0] = 1 for i in range(n): for j in range(n): if l[i][j] != 0 and mark[i] == 1: mark[j] = 1 for i in range(n): if mark[i] == 0: retu...原创 2019-03-14 06:53:21 · 612 阅读 · 0 评论 -
python之Prim算法
提交到csp认证模拟考试平台依旧是超时,不知道正确性,求指正 n = int(input()) m = int(input()) root = int(input()) list1 = [([0]*n) for i in range(n)] queue = [] mark = n * [0] queue.append(root) mark[root-1] = 1 for i in range(m)...原创 2019-03-14 08:20:32 · 593 阅读 · 0 评论 -
python之prim算法2
提交依旧超时,但是比前面的都好 n = int(input()) m = int(input()) root = int(input()) list1 = [([0]*n) for i in range(n)] for i in range(m): temp = list(map(int, input().split())) list1[temp[0]-1][temp[1]-1] = temp[2...原创 2019-03-14 11:16:38 · 218 阅读 · 0 评论