...

/

Solution: Number of Connected Components in an Undirected Graph

Solution: Number of Connected Components in an Undirected Graph

Let's solve the Number of Connected Components in an Undirected Graph problem using the Union Find pattern.

Statement

For a given integer, n, and an array, edges, return the number of connected components in a graph containing n nodes.

Note: The array edges[i] = [x, y] indicates that there’s an edge between x and y in the graph.

Constraints:

  • 11 \leq n 2000 \leq 2000

  • 11 \leq edges.length 5000\leq 5000

  • edges[i].length ==2== 2 ...