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:
return False
return True
def hasLoop(l, n, m):
du = []
for i in range(n):
num = 0
for j in range(n):
if l[i][j] != 0:
num += 1
du.append(num)
hasone = True
while(hasone):
hasone = False
for i in range(n):
if du[i] == None:
continue
if du[i] <= 1:
hasone =True
du[i] = None
for j in range(n):
if l[i][j] != 0 and du[j] != None:
du[j] -= 1
break
for i in range(n):
if du[i]:
return True
return False
n = int(input())
m = int(input())
root = int(input())
list1 = [([0]*n) for i in range(n)]
list2 = []
for i in range(m):
temp = list(map(int, input().split()))
list2.append(temp)
list2.sort(key=lambda x: (x[2]))
result = 0
for i in range(m):
list1[list2[i][0]-1][list2[i][1]-1] = list2[i][2]
list1[list2[i][1]-1][list2[i][0]-1] = list2[i][2]
if hasLoop(list1, n, m):
list1[list2[i][0]-1][list2[i][1]-1] = 0
list1[list2[i][1]-1][list2[i][0]-1] = 0
else:
result = list2[i][2]
if isTong(list1, n, m):
break
print(result)