Floyd warshall algorithm for python added

Author: SouvikGhosh05

Dynamic Programming/Floyd_warshall.py

@@ -0,0 +1,34 @@
+# Floyd Warshall Algorithm in Python
+# https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
+
+nV = 4  # The number of vertices
+
+INF = 999
+
+
+# Algorithm implementation
+def floyd_warshall(G):
+    distance = list(map(lambda i: list(map(lambda j: j, i)), G))
+
+    # Adding vertices individually
+    for k in range(nV):
+        for i in range(nV):
+            for j in range(nV):
+                distance[i][j] = min(distance[i][j], distance[i][k] + distance[k][j])
+    print_solution(distance)
+
+def print_solution(distance):
+    for i in range(nV):
+        for j in range(nV):
+            if(distance[i][j] == INF):
+                print("INF", end=" ")
+            else:
+                print(distance[i][j], end="  ")
+        print("  ")
+
+
+G = [[0, 3, INF, 5],
+         [2, 0, INF, 4],
+         [INF, 1, 0, INF],
+         [INF, INF, 2, 0]]
+floyd_warshall(G)