Tap here to switch tabs
Problem
Submissions

Problem: Number of Connected Components in an Undirected Graph

Number of Connected Components in an Undirected Graph gives you a number of nodes and an edge list, then asks how many separate groups of nodes are linked by paths.

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:

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

  • 0≤0 \leq edges.length ≤1000\leq 1000

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

  • 0≤0 \leq x ,, y <\lt n

  • x ≠\neq y

  • There are no repeated edges.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Number of Connected Components in an Undirected Graph

Number of Connected Components in an Undirected Graph gives you a number of nodes and an edge list, then asks how many separate groups of nodes are linked by paths.

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:

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

  • 0≤0 \leq edges.length ≤1000\leq 1000

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

  • 0≤0 \leq x ,, y <\lt n

  • x ≠\neq y

  • There are no repeated edges.