Connectivity in a graph means that there is a path between every pair of the vertex in the graph. In graph theory, Connectivity is a simple yet very widely used concept. DFS and BFS traversals in a graph can be used to determine whether a graph is connected or not. The connectivity concept is used to find the number of connected components in a graph which is widely used in programming contests.
Find the number of islands
By Aditya Narayan Joardar
● Published At Dec 2021
This article discusses finding the number of islands in a given 2D matrix using DFS.... Keep reading ..
Number of Islands
By Alisha Chhabra
● Published At Nov 2021
This article covers the approach and Implementation of the problem Number of Islands in java. ... Keep reading ..
Minimum number of swaps required to sort an array
By Shreya Deep
● Published At Dec 2021
In this article, we will learn how to find the minimum number of swaps required to be done to sort an array... Keep reading ..
Weakly Connected Components in a Directed Graph
● Published At Jan 2022
A directed graph is weakly connected if its undirected graph is connected. In this article, we will find weakly connected components in a given directed graph. ... Keep reading ..
puzzle icon

Top Problems related to Connectivity