Python graph theory Algorithm (iii)--kruskal

Edge = [[[1,2,1],[1,2,3],[1,3,2],[2,3,1],[2,4,4],[3,4,2]]  #这是用边集合表示的图s = [[]]n = 4for i in range (n):    s.append ([i +1]) #print The S#compare method is written in order to sort the edges, passing in sort as a parameter, you can sort the Def compare (A, B):    if (a[2] > b[2]):        return 1    elif (a[ 2] < b[2]):        return-1    Else:        return 0edge.sort (Compare) #这就是sort () The big point for the       e in edge:#    print s< C11/>if s[e[0]]! = s[e[1]]:        print E for        i in S[e[1]]:            if (I am not in s[e[0]):                s[e[0]].append (i)            s [e[1]] = s[e[0]]

This involves merging and comparing collections.

Python graph theory Algorithm (iii)--kruskal