From ab5298c64e8823a26a0d2a26777070daa8cb8244 Mon Sep 17 00:00:00 2001
From: Ayushi Chakrabarty <67193440+AyushiChakrabarty@users.noreply.github.com>
Date: Sun, 12 Dec 2021 09:21:59 +0530
Subject: [PATCH] Create BFS_Connected Graph-2

---
 BFS_Connected Graph-2 | 42 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 BFS_Connected Graph-2

diff --git a/BFS_Connected Graph-2 b/BFS_Connected Graph-2
new file mode 100644
index 0000000..5e819d7
--- /dev/null
+++ b/BFS_Connected Graph-2	
@@ -0,0 +1,42 @@
+   #include <iostream>
+   #include <vector>
+    using namespace std;
+
+    vector <int> adj[10];
+    bool visited[10];
+
+    void dfs(int s) {
+        visited[s] = true;
+        for(int i = 0;i < adj[s].size();++i)    {
+         if(visited[adj[s][i]] == false)
+             dfs(adj[s][i]);
+        }
+    }
+
+    void initialize() {
+        for(int i = 0;i < 10;++i)
+         visited[i] = false;
+    }
+
+    int main() {
+        int nodes, edges, x, y, connectedComponents = 0;
+        cin >> nodes;                       //Number of nodes
+        cin >> edges;                       //Number of edges
+        for(int i = 0;i < edges;++i) {
+         cin >> x >> y;     
+     //Undirected Graph 
+         adj[x].push_back(y);                   //Edge from vertex x to vertex y
+         adj[y].push_back(x);                   //Edge from vertex y to vertex x
+        }
+
+        initialize();                           //Initialize all nodes as not visited
+
+        for(int i = 1;i <= nodes;++i) {
+         if(visited[i] == false)     {
+             dfs(i);
+             connectedComponents++;
+         }
+        }
+        cout << "Number of connected components: " << connectedComponents << endl;
+        return 0;
+    }