Disconnected Components Counter

Given an undirected graph represented by an adjacency list, count the number of disconnected components in the graph. The input will start with an integer N, the number of nodes (0-indexed from 0 to N-1), followed by M pairs of integers representing edges. Each edge connects two nodes. For example, the input: 5 0 1 0 2 3 4 represents a graph with 5 nodes and 3 edges, where nodes 0, 1, and 2 form one component, and nodes 3 and 4 form another, resulting in 2 components overall. Output the number of disconnected components in the graph.