Count the Number of Complete Components

Medium

Given n nodes labeled 0..n-1 and a list of undirected edges, return the number of complete connected components. A connected component is complete if every pair of its vertices is connected by a direct edge.

Example 1

Input:  n = 6, edges = [[0,1],[0,2],[1,2],[3,4]]
Output: 3

Example 2

Input:  n = 6, edges = [[0,1],[0,2],[1,2],[3,4],[3,5]]
Output: 1

Constraints

• 1 <= n <= 50
• 0 <= edges.length <= n*(n-1)/2
• No repeated edges and no self-loops.