algorithms.tutorialhorizon.com

Check if given undirected graph is connected or not | Algorithms

Objective: Given an undirected graph, write an algorithm to find out whether the graph is connected or not. Graph Connectivity: If each vertex of a graph is connected to one or multiple vertices then the graph is called a Connected graph whereas if there exists even one vertex which is not connected to any vertex of the graph then it is called Disconnect or not connected graph.