크루스컬 알고리즘

def kruskal(self):
    self.graph.sort(key = lambda t: t[2])
    tree = []
    nEdge = 0
    i = 0
    while nEdge < self.nNode - 1:
        if self.isCycle(self.graph[i][0], self.graph[i][1]) == False:
            tree.append(self.graph[i])
            nEdge += 1
        else:
            print("싸이클 형성")
        i += 1
    return tree