Number of Connected Components
You have a graph of n nodes. You are given an integer n and an array edges where edges[i] = [ai, bi] indicates that there is an edge between ai and bi in the graph. Return the number of connected components in the graph.
Number of Connected Components

You have a graph of n nodes. You are given an integer n and an array edges where edges[i] = [ai, bi] indicates that there is an edge between ai and bi in the graph. Return the number of connected components in the graph.

Example 1:
Input: {"n":5,"edges":[[0,1],[1,2],[3,4]]}
Output: 2
Input
arr ={"n":5,"edges":[[0,1],[1,2],[3,4]]}

Initialize Union-Find. Each node is its own component. Total: 5

Components: 5
0
1
2
3
4
Parent Array
0
0
1
1
2
2
3
3
4
4
Variables
No variables to display
DepthFunction Call
Stack empty
0/4