2685. Count the Number of Complete Components

Given an undirected graph of n vertices and edges. A connected component is complete if every pair of its vertices is connected by an edge. Count the complete components. A component of k vertices is…