From 3bc31ddd1ced4d07e57c7fa43d73b2ff7228da57 Mon Sep 17 00:00:00 2001
From: Abhay Saini <abhaysaini1974@gmail.com>
Date: Wed, 5 Oct 2022 22:55:22 +0530
Subject: [PATCH] Create Prim's Algorithm.cpp

---
 .../C++/Prim's Algorithm.cpp                  | 41 +++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 Program's_Contributed_By_Contributors/C++/Prim's Algorithm.cpp

diff --git a/Program's_Contributed_By_Contributors/C++/Prim's Algorithm.cpp b/Program's_Contributed_By_Contributors/C++/Prim's Algorithm.cpp
new file mode 100644
index 0000000000..a3dcc0ea02
--- /dev/null
+++ b/Program's_Contributed_By_Contributors/C++/Prim's Algorithm.cpp	
@@ -0,0 +1,41 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int m,n;
+    cin>>m>>n;
+    vector<pair<int,int>> adj[m];
+    for(int i =0;i<n;i++){
+        int x,y,w;
+        cin>>x>>y>>w;
+        adj[x].push_back({y,w});
+        adj[y].push_back({x,w});
+    }
+
+    vector<int> key(m,INT_MAX),parent(m,-1),mst(m,false);
+    key[0]=0;
+    parent[0]=-1;
+
+    for(int i =0;i<m-1;i++){
+        int mini=INT_MAX,u;
+        for(int i =0;i<m;i++){
+            if(key[i]<mini&&mst[i]==false){
+                mini = key[i];
+                u = i;
+            }
+        }
+        mst[u]=true;
+        for(auto it: adj[u]){
+            int v = it.first;
+            int weight = it.second;
+            if(mst[v]==false&&weight<key[v]){
+                parent[v] = u;
+                key[v]=weight;
+            }
+        }
+    }
+
+    for(int i =0;i<m;i++){
+        cout<<parent[i]<<" -> "<<i<<endl;
+    }
+    return 0;
+}