LeetCode – Number of Connected Components in an Undirected Graph (Java)

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. For example: 0 3 | | 1 — 2 4 Given n = 5 and edges = [[0, … Read more