The algorithm finds connected components inside the given graph using Disjoint Set/Union Find data structure and calculates the maximum size of the paired connected components
The algorithm finds connected components inside the given graph using Disjoint Set/Union Find data structure and calculates the maximum size of the paired connected components