solved issue #282

Author: varunsingh005

floydWarshall.cpp

@@ -0,0 +1,57 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+#define V 4
+
+#define INF 99999
+
+void printSol(int dist[][V]);
+
+void floydWarshall(int graph[][V])
+{
+	int dist[V][V];
+	for(int i=0; i<V; ++i)
+		for(int j=0; j<V; ++j)
+			dist[i][j] = graph[i][j];
+
+	for(int k = 0; k<V; ++k)
+	{
+		for(int i=0; i<V; ++i)
+		{
+			for(int j=0; j<V; ++j)
+			{
+				if(dist[i][j] > dist[i][k] + dist[k][j])
+					dist[i][j] = dist[i][k] + dist[k][j];
+			}
+		}
+	}
+	printSol(dist);
+}
+
+void printSol(int dist[][V])
+{
+	for(int i=0; i<V; ++i)
+	{
+		for(int j=0; j<V; ++j)
+		{
+			if(dist[i][j] == INF)
+				cout<<"INF ";
+			else
+				cout<<dist[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+}
+
+int main()
+{
+	int graph[V][V] = { {0,   5,  INF, 10}, 
+                        {INF, 0,   3, INF}, 
+                        {INF, INF, 0,   1}, 
+                        {INF, INF, INF, 0} 
+                      }; 
+  
+    floydWarshall(graph); 
+	return 0;
+}