Given an undirected graph g, the task is to print the number of connected components in the graph.
There are three connected components:
1 – 5, 0 – 2 – 4 and 3
Approach: The idea is to use a variable count to store the number of connected components and do the following steps:
- Initialize all vertices as unvisited.
- For all the vertices check if a vertex has not been visited, then perform DFS on that vertex and increment the variable count by 1.
Below is the implementation of the above approach:
- Maximum number of edges among all connected components of an undirected graph
- Connected Components in an undirected graph
- Sum of the minimum elements in all connected components of an undirected graph
- Clone an undirected graph with multiple connected components
- Number of single cycle components in an undirected graph
- Cycles of length n in an undirected and connected graph
- Count number of edges in an undirected graph
- Kth largest node among all directly connected nodes to the given node in an undirected graph
- Number of connected components in a 2-D matrix of strings
- Program to find Circuit Rank of an Undirected Graph
- Strongly Connected Components
- Number of Triangles in an Undirected Graph
- Undirected graph splitting and its application for number pairs
- Tarjan's Algorithm to find Strongly Connected Components
- Convert the undirected graph into directed graph such that there is no path of length greater than 1
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.