Number of connected components
Mediumgraphunion finddfs
There are n nodes 0 to n-1 and undirected edges. Return the number of connected components: groups of nodes that can reach each other.
Example 1
Input: n = 5, edges = [[0,1],[1,2],[3,4]] Output: 2
Example 2
Input: n = 5, edges = [[0,1],[1,2],[2,3],[3,4]] Output: 1
Constraints
- 1 ≤ n ≤ 2000
- 0 ≤ edges.length ≤ 5000
- No repeated edges
Submit checks your solution against 8 tests, including hidden ones.
/**
* @param {int} n
* @param {int[][]} edges
* @return {int}
*/
function countComponents(n, edges) {
}