editing doctest

Author: Ajmera, Mahita SI/HZR-IDSA

graphs/graphs_floyd_warshall.py

@@ -50,6 +50,12 @@ def floyd_warshall(graph, v):
     ... ]
     >>> dist, _ = floyd_warshall(graph, num_vertices)
     >>> dist == expected
+
+    The shortest path matrix using Floyd Warshall algorithm
+
+    0	2	INF
+    1	0	INF
+    INF	INF	0
     True
     """