Solve : Graph Valid Tree

Author: printjin-gmailcom

graph-valid-tree/printjin-gmailcom.py

@@ -0,0 +1,16 @@
+class Solution:
+    def valid_tree(self, n, edges):
+        if len(edges) != n - 1:
+            return False
+        parent = [i for i in range(n)]
+        def find(x):
+            while parent[x] != x:
+                parent[x] = parent[parent[x]]
+                x = parent[x]
+            return x
+        for u, v in edges:
+            pu, pv = find(u), find(v)
+            if pu == pv:
+                return False
+            parent[pu] = pv
+        return True