Cheapest_Flights_Within_K_Stops

Author: Ishika81

Dynamic Programming/[LeetCode]Cheapest_Flights_Within_K_Stops.cpp

@@ -0,0 +1,27 @@
+// Problem Description:- Cheapest_Flights_Within_K_Stops
+// Link:- https://leetcode.com/problems/cheapest-flights-within-k-stops/
+
+
+class Solution {
+public:
+    //Bellman Ford Algorithm
+    int shortestPath(vector<vector<int>>& flights,int src,int dst,int k,int n){
+        vector<int> dist(n,INT_MAX);
+        dist[src] = 0;
+        for(int count=0; count<=k; count++){
+            vector<int> temp = dist;
+            for(vector<int>& v: flights){
+                if(dist[v[0]] == INT_MAX)
+                    continue;
+				//Relax Operation
+                if(temp[v[1]] > dist[v[0]] + v[2])
+                    temp[v[1]] = dist[v[0]] + v[2];
+            }
+            dist = temp;
+        }
+        return (dist[dst] == INT_MAX ? -1 : dist[dst]);
+    }
+    int findCheapestPrice(int n, vector<vector<int>>& flights, int src, int dst, int k) {
+        return shortestPath(flights,src,dst,k,n);
+    }
+};