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

commenting out print statement

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

12
graphs/graphs_floyd_warshall.py
View File

@ -6,13 +6,13 @@ weighted directed graph that can have negative edge weights.
def _print_dist(dist, v): def _print_dist(dist, v):
print("The shortest path matrix using Floyd Warshall algorithm") print("\nThe 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"):
print(int(dist[i][j]), end=" ") print(int(dist[i][j]), end="\t")
else: else:
print("INF", end=" ") print("INF", end="\t")
print() print()
@ -46,10 +46,6 @@ def floyd_warshall(graph, v):
... [float('inf'), float('inf'), 0] ... [float('inf'), float('inf'), 0]
... ] ... ]
>>> dist, _ = floyd_warshall(graph, num_vertices) >>> dist, _ = floyd_warshall(graph, num_vertices)
The shortest path matrix using Floyd Warshall algorithm
0 2 INF
1 0 INF
INF INF 0
>>> dist == expected >>> dist == expected
True True
""" """
@ -73,7 +69,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