Leetcode-Question-323: Number of Connected Components in an Undirected Graph

Original Link:

https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/

Description:

Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to find the number of connected components in an undirected graph.

Example 1:

Given n = 5 and edges = [[0, 1], [1, 2], [3, 4]], return 2.

Example 2:

Given n = 5 and edges = [[0, 1], [1, 2], [2, 3], [3, 4]], return 1.

Note:
You can assume that no duplicate edges will appear in edges. Since all edges are undirected, [0, 1] is the same as [1, 0] and thus will not appear together in edges.

Solution:

UnionFind

 

发表评论

电子邮件地址不会被公开。 必填项已用*标注