From ea991416be8e42cb26440fea972ba47874599c90 Mon Sep 17 00:00:00 2001
From: chanchal200519 <115028150+chanchal200519@users.noreply.github.com>
Date: Wed, 12 Oct 2022 22:36:20 +0530
Subject: [PATCH] Create warshall.cpp

---
 warshall.cpp | 51 +++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 warshall.cpp

diff --git a/warshall.cpp b/warshall.cpp
new file mode 100644
index 0000000..369dffe
--- /dev/null
+++ b/warshall.cpp
@@ -0,0 +1,51 @@
+// Floyd-Warshall Algorithm in C++
+
+#include <iostream>
+using namespace std;
+
+// defining the number of vertices
+#define nV 4
+
+#define INF 999
+
+void printMatrix(int matrix[][nV]);
+
+// Implementing floyd warshall algorithm
+void floydWarshall(int graph[][nV]) {
+  int matrix[nV][nV], i, j, k;
+
+  for (i = 0; i < nV; i++)
+    for (j = 0; j < nV; j++)
+      matrix[i][j] = graph[i][j];
+
+  // Adding vertices individually
+  for (k = 0; k < nV; k++) {
+    for (i = 0; i < nV; i++) {
+      for (j = 0; j < nV; j++) {
+        if (matrix[i][k] + matrix[k][j] < matrix[i][j])
+          matrix[i][j] = matrix[i][k] + matrix[k][j];
+      }
+    }
+  }
+  printMatrix(matrix);
+}
+
+void printMatrix(int matrix[][nV]) {
+  for (int i = 0; i < nV; i++) {
+    for (int j = 0; j < nV; j++) {
+      if (matrix[i][j] == INF)
+        printf("%4s", "INF");
+      else
+        printf("%4d", matrix[i][j]);
+    }
+    printf("\n");
+  }
+}
+
+int main() {
+  int graph[nV][nV] = {{0, 3, INF, 5},
+             {2, 0, INF, 4},
+             {INF, 1, 0, INF},
+             {INF, INF, 2, 0}};
+  floydWarshall(graph);
+}