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.

30:00

Number of Connected Components
medium
Topics
Companies

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
Constraints:

  • 1≤n≤20001 \leq n \leq 2000

  • 1≤edges.length≤50001 \leq \text{edges.length} \leq 5000

  • edges[i].length==2\text{edges}[i].\text{length} == 2

  • 0≤ai,bi<n0 \leq a_i, b_i < n

  • ai≠bia_i \neq b_i

  • There are no repeated edges.

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