Pseudo Code

kruskal(n, edges):
   parent[i] = i for all i          # 각 정점은 자신만의 집합을 가짐
   total = 0
   repeat until all edges considered:
      pick the unused edge (u, v, w) with the smallest w
      ru = find(u); rv = find(v)
      if ru != rv:                   # 사이클 없음
         parent[ru] = rv             # 합치기(union)
         total += w
   return total

find(x):
   while parent[x] != x: x = parent[x]
   return x