mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-12-18 17:20:16 +00:00
Code Issues Packages Projects Releases Wiki Activity

including print statement and output in doctest

Browse Source
This commit is contained in:
Ajmera, Mahita SI/HZR-IDSA 2024-10-17 11:37:15 +02:00
parent f01de409de
commit bf3c0c3de9
1 changed files with 7 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
graphs/graphs_floyd_warshall.py
View File

@ -6,7 +6,7 @@ weighted directed graph that can have negative edge weights.
def _print_dist(dist, v): def _print_dist(dist, v):
print("\nThe shortest path matrix using Floyd Warshall algorithm\n") print("The shortest path matrix using Floyd Warshall algorithm\n")
for i in range(v): for i in range(v):
for j in range(v): for j in range(v):
if dist[i][j] != float("inf"): if dist[i][j] != float("inf"):
@ -45,6 +45,11 @@ def floyd_warshall(graph, v):
... [9, 7, 0] ... [9, 7, 0]
... ] ... ]
>>> dist, _ = floyd_warshall(graph, 3) >>> dist, _ = floyd_warshall(graph, 3)
The shortest path matrix using Floyd Warshall algorithm
0 3 INF
2 0 INF
9 7 0
>>> dist == expected >>> dist == expected
True True
""" """
@ -68,7 +73,7 @@ def floyd_warshall(graph, v):
): ):
dist[i][j] = dist[i][k] + dist[k][j] dist[i][j] = dist[i][k] + dist[k][j]
# _print_dist(dist, v) _print_dist(dist, v)
return dist, v return dist, v