From 7d792460b5302335e73a4fe3ad065de36252de2d Mon Sep 17 00:00:00 2001
From: Kshitiz Sharma <110187324+kshitiz11101@users.noreply.github.com>
Date: Mon, 13 May 2024 12:26:51 +0530
Subject: [PATCH] Create NumberofGoodComponent.cpp

---
 Graphs/NumberofGoodComponent.cpp | 36 ++++++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)
 create mode 100644 Graphs/NumberofGoodComponent.cpp

diff --git a/Graphs/NumberofGoodComponent.cpp b/Graphs/NumberofGoodComponent.cpp
new file mode 100644
index 0000000..fc38973
--- /dev/null
+++ b/Graphs/NumberofGoodComponent.cpp
@@ -0,0 +1,36 @@
+class Solution {
+    private:
+    void dfs(int node,vector<int>adj[],int &vcount,int &ecount,vector<int>&visited){
+        visited[node]=1;
+        vcount+=1;
+        ecount+=adj[node].size();
+        for(auto i:adj[node]){
+            if(visited[i]==0){
+                dfs(i,adj,vcount,ecount,visited);
+            }
+        }
+    }
+public:
+    int countCompleteComponents(int n, vector<vector<int>>& edges) {
+        int ans=0;
+        vector<int>visited(n,0);
+        vector<int>adj[n];
+        for(int i=0;i<edges.size();i++){
+            int u=edges[i][0];
+            int v=edges[i][1];
+            adj[u].push_back(v);
+            adj[v].push_back(u);
+        }
+        
+        for(int i=0;i<n;i++){
+               int vcount=0,ecount=0;
+           if(!visited[i]){
+               dfs(i,adj,vcount,ecount,visited);
+               if(vcount*(vcount-1)==ecount){
+                   ans++;
+               }
+               }  
+        }
+        return ans;
+    }
+};