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 and a
阅读背景：
Leetcode: Number of Connected Components in an Undirected Graph
来源：互联网
分享到：
