2685 Count the Number of Complete Components

Описание: 2685 Count the Number of Complete Components. This Java code counts the number of complete components in an undirected graph.
A complete component is defined as a subset of nodes where every pair of nodes is connected by an edge.
summary:
Graph Representation: It builds an adjacency list to represent the graph using an array of lists.
DFS Traversal: It uses Depth-First Search (DFS) to explore each component of the graph.
During the traversal, it counts the number of nodes and edges in the component.
Complete Component Check: After exploring a component, it checks if the number of edges matches
the expected number for a complete graph (which is v (v - 1) / 2, where v is the number of nodes).
It accounts for the fact that each edge is counted twice.
Count Complete Components: If a component is complete, it increments the count of complete components.
Return Result: Finally, it returns the total count of complete components found in the graph.