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

editing doctest

Browse Source
This commit is contained in:
Ajmera, Mahita SI/HZR-IDSA 2024-10-17 10:51:54 +02:00
parent e1ad21cd6a
commit 199db30829
1 changed files with 1 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
graphs/graphs_floyd_warshall.py
View File

@ -39,17 +39,13 @@ def floyd_warshall(graph, v):
... [float('inf'), float('inf'), float('inf')], ... [float('inf'), float('inf'), float('inf')],
... [float('inf'), float('inf'), float('inf')] ... [float('inf'), float('inf'), float('inf')]
... ] ... ]
>>> for i in range(num_vertices):
... graph[i][i] = 0.0
>>> graph[0][1] = 2
>>> graph[1][0] = 1
>>> expected = [ >>> expected = [
... [0, 2, float('inf')], ... [0, 2, float('inf')],
... [1, 0, float('inf')], ... [1, 0, float('inf')],
... [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 The shortest path matrix using Floyd Warshall algorithm
0 2 INF 0 2 INF