Solution: Number of Operations to Make Network Connected

Statement

You are given n computers labeled from $0$ to $n - 1$ and a list connections, where each element connections[i] = [a_i, b_i] represents a cable directly connecting computers a_i and b_i.

A cable can be removed from its current pair of computers and reconnected between any two computers.

Return the minimum number of such cable move operations needed to make all n computers part of a single connected network. If it is impossible to connect all computers, return $-1$.

Constraints:

• $1 \leq$ n $\leq 10^5$ ...