From ee2fb46155101cbaac471a7e7e4882482a6a3978 Mon Sep 17 00:00:00 2001
From: Ritik Nandwal <ritiknandwal021@gmail.com>
Date: Wed, 21 Jul 2021 19:47:59 +0530
Subject: [PATCH] Add implementation for finding minimum cost to make path b/w
 src to dest

---
 graph/minEdgetomakepath.cpp | 43 +++++++++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 graph/minEdgetomakepath.cpp

diff --git a/graph/minEdgetomakepath.cpp b/graph/minEdgetomakepath.cpp
new file mode 100644
index 0000000..5ddd8d8
--- /dev/null
+++ b/graph/minEdgetomakepath.cpp
@@ -0,0 +1,43 @@
+#include<bits/stdc++.h>
+using namespace std;
+void solve(int src,int dest,vector<int> adj[],int n){
+    vector<pair<int,int>> newAdj[n];
+    for(int i=0;i<n;i++){
+        int u = i;
+        for(auto v:adj[i]){
+            newAdj[u].push_back({v,0});
+            newAdj[v].push_back({u,1});
+        }
+    }
+    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;
+    pq.push({0,src});
+    vector<int> cost(n,INT_MAX);
+    cost[src]=0;
+    while(!pq.empty()){
+        auto pnt = pq.top().second;pq.pop();
+        for(auto x:newAdj[pnt]){
+            if(x.second+cost[pnt] < cost[x.first]){
+                cost[x.first] = x.second+cost[pnt];
+                pq.push({cost[x.first],x.first});
+            }
+        }
+    }
+    cout<<"Minimum cost required "<<cost[dest]<<endl;
+    return;
+
+}
+int main(){
+    int n,e;
+    // taking 0 based numbering for vertices of graph
+    cin>>n>>e;
+    vector<int> adj[n];
+    for(int i=0;i<e;i++){
+        int u,v;
+        cin>>u>>v;
+        adj[u].push_back(v);
+    }
+    int src,dest;
+    cin>>src>>dest;
+    solve(src,dest,adj,n);
+    return 0;
+}
\ No newline at end of file