Divide Nodes Into the Maximum Number of Groups

Assign each node an integer group 1..m so every edge joins nodes whose group indices differ by exactly 1; return the maximum possible m or -1 if no such labeling exists. Core challenge: detect impossibility (odd cycles) and compute the maximum feasible layering (longest valid BFS-like level assignment) across the graph/components.