Find the Number of Connected Components in a Graph

Problem statement

Find the connected components in an undirected graph.

In graph theory, a connected component (or just component) of an undirected graph is a sub-graph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices in the super-graph.

Solution

This problem can be solved using Depth-First Search. Let’s move on to the implementation as the Depth First Approach must already be clear. Let’s look at the code.