Divide Nodes Into the Maximum Number of Groups

Statement

You are given an undirected graph with n nodes labeled from $1$ to n, and an edge list edges where each edges[i] connects two distinct nodes.

You want to partition all nodes into the maximum possible number of non empty groups, numbered consecutively from $1$ ...