#656 · #2493 · Divide Nodes Into the Maximum Number of Groups(将节点分成尽可能多的组)

You are given an undirected graph of n nodes and edges. Divide the nodes into the maximum number of groups such that: every edge connects nodes in the same group or in adjacent groups, and for any two groups with an edge between them, every node of one is connected to every node of the other. Return the maximum number of groups, or -1 if impossible. Constraints: 1 <= n <= 500, 0 <= edges.length <= n*(n-1)/2.