Connected Components in an Undirected Graph

Given an undirected graph with $N$ nodes and $M$ edges, determine the number of connected components in the graph. A connected component is a set of nodes where every node is reachable from any other node within the same set. Note that isolated nodes (nodes with no edges) are considered as separate connected components.

Input Graph Representation:
- The first line contains two integers $N$ and $M$, representing the number of nodes and edges respectively.
- The following $M$ lines each contain two integers $u$ and $v$, denoting an undirected edge between node $u$ and node $v$.

Output:
Output a single integer representing the number of connected components in the graph.

inputFormat

The input is provided via standard input (stdin). The first line contains two space-separated integers $N$ and $M$, where $N$ is the number of nodes and $M$ is the number of edges. Each of the next $M$ lines contains two space-separated integers $u$ and $v$, representing an edge between nodes $u$ and $v$.

outputFormat

Output a single integer to standard output (stdout) representing the number of connected components in the graph.## sample

5 3
1 2
1 3
4 5

2