Connecting Cities With Minimum Cost

lcpy gen -n 1135   # by problem number
lcpy gen -s connecting_cities_with_minimum_cost   # by problem name

Input: n = 3, connections = [[1,2,5],[1,3,6],[2,3,1]]
Output: 6
Explanation: Choosing any 2 edges will connect all cities so we choose the minimum 2.

Input: n = 4, connections = [[1,2,3],[3,4,4]]
Output: -1
Explanation: There is no way to connect all cities even if all edges are used.

class Solution:
    # Time: O(m log m) where m = len(connections)
    # Space: O(n)
    def minimum_cost(self, n: int, connections: list[list[int]]) -> int:
        parent = list(range(n + 1))
        rank = [0] * (n + 1)

        def find(node: int) -> int:
            root = node
            while parent[root] != root:
                root = parent[root]
            while parent[node] != root:
                parent[node], node = root, parent[node]
            return root

        total = 0
        edges_used = 0
        for x, y, cost in sorted(connections, key=lambda edge: edge[2]):
            rx, ry = find(x), find(y)
            if rx == ry:
                continue
            if rank[rx] < rank[ry]:
                rx, ry = ry, rx
            parent[ry] = rx
            if rank[rx] == rank[ry]:
                rank[rx] += 1
            total += cost
            edges_used += 1
            if edges_used == n - 1:
                return total
        return total if edges_used == n - 1 else -1