Merge pull request #67 from AlgoLeadMe/17-seongwon030

17-seongwon030

seongwon030/최소스패닝트리/최소스패닝트리.py

@@ -0,0 +1,30 @@
+import sys
+
+input = sys.stdin.readline
+
+V,E = map(int,input().split())
+root = [i for i in range(V+1)]
+edge = [] # 간선리스트
+for i in range(E): 
+  edge.append(list(map(int,input().split())))
+
+# 비용을 기준으로 오름차순
+edge.sort(key=lambda x:x[2])
+
+def find(x):
+  if x!=root[x]:
+    root[x] = find(root[x])
+  return root[x]
+
+ans = 0 
+for a,b,c in edge:
+  aRoot = find(a)
+  bRoot = find(b)
+  if aRoot != bRoot:
+    if aRoot > bRoot:
+      root[aRoot] = bRoot
+    else:
+      root[bRoot] = aRoot
+    ans += c
+
+print(ans)