Bismillahir Rahmanir Rahim A graph is said to be connected if there is a path between every pair of vertex . From every vertex to any other vertex, there should be some path to traverse. That is called the connectivity of a graph. A graph with multiple disconnected vertices and edges is said to be disconnected. Connected Graph Disconnected Graph We can check graph connectivity through dfs algorithm. Depth first Search or Depth first traversal is a recursive algorithm for searching all the vertices of a graph or tree data structure. Traversal means visiting all the nodes of a graph . Starting from 1 traverse like that 1 -> 2 -> 5 -> 6 -> 3 -> 4 -> 7 DFS Code is given below. #include< bits/stdc++.h > using namespace std; const int N= 1e5 + 9 ; vector< int ...
I am Tanvir Ahmmad from Bangladesh. Working as a competitive programmer. It will be very pleasure to help you. Happy coding...