Deep in the spice bazaar of Saffronia, Fletcher studies rows of tunnels entries. One clean number will settle the guild's oldest argument. Task: An undirected graph has n nodes and m edges. Print the number of connected components. Input format: First line: n and m. Next m lines: u v. Output format: Print the component count. Constraints: 1 <= n <= 1500; 0 <= m <= 3000; 1 <= u,v <= n.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 1500; 0 <= m <= 3000; 1 <= u,v <= n.
