From dc98bb895f278d2ed7be99f54a2688f51d4ab89f Mon Sep 17 00:00:00 2001
From: Harsh Singh <93440683+harshsinghreal@users.noreply.github.com>
Date: Wed, 30 Oct 2024 16:43:09 +0530
Subject: [PATCH] Create BFSsolution.cpp

Added bfs solution to Number of Operations to Make Network Connected.
---
 .../BFSsolution.cpp                           | 40 +++++++++++++++++++
 1 file changed, 40 insertions(+)
 create mode 100644 Cpp/1319-Number-of-Operations-to-Make-Network-Connected/BFSsolution.cpp

diff --git a/Cpp/1319-Number-of-Operations-to-Make-Network-Connected/BFSsolution.cpp b/Cpp/1319-Number-of-Operations-to-Make-Network-Connected/BFSsolution.cpp
new file mode 100644
index 0000000..ee09f2e
--- /dev/null
+++ b/Cpp/1319-Number-of-Operations-to-Make-Network-Connected/BFSsolution.cpp
@@ -0,0 +1,40 @@
+class Solution {
+public:
+    int makeConnected(int n, vector<vector<int>>& c) {
+        int edges = c.size();;
+        
+        if( edges < n - 1 ){
+            return -1;
+        }
+        
+        vector<int> adj[n];
+        vector<int> vis(n, 0);
+        
+        for( int i=0; i < c.size(); i++ ) {
+            adj[ c[i][0] ].push_back( c[i][1] );
+            adj[ c[i][1] ].push_back( c[i][0] );
+        }
+        queue<int> q;
+        int count = 0;
+        
+        for(int i = 0; i<n; i++) {
+            if( !vis[i] ) {
+               count++;
+               vis[i] = 1;
+                q.push(i);
+               while(!q.empty()){  
+                int node = q.front();
+                q.pop();
+                for(auto x : adj[node]) {
+                    if( !vis[x] ) {
+                        q.push(x);
+                        vis[x] = 1;
+                    }
+                } 
+             }
+           }
+        }
+        count--;
+        return count;        
+    }
+};