Added type hints and return types for the function

Author: XenoBytesX

graphs/floyd_warshall.py

@@ -12,8 +12,7 @@
 Wiki page:- <https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm>
 """
 
-
-def floyd_warshall(graph, n):
+def floyd_warshall(graph: list[list], num_nodes: int) -> list[list]:
     """
     Returns the shortest distance between all pairs of nodes
 
@@ -37,14 +36,13 @@ def floyd_warshall(graph, n):
     """
     # The graph is a Adjancecy matrix (see <https://en.wikipedia.org/wiki/Adjacency_matrix>)
     distance: list[list] = graph
-    for k in range(n):
-        for i in range(n):
-            for j in range(n):
+    for k in range(num_nodes):
+        for i in range(num_nodes):
+            for j in range(num_nodes):
                 distance[i][j] = min(distance[i][j], distance[i][k] + distance[k][j])
     return distance
 
-
-if __name__ == "__main__":
+if __name__ == '__main__':
     """
     Layout of G:-
            2           2           1           1           5