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

changing pytest

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

13
graphs/graphs_floyd_warshall.py
View File

@ -33,17 +33,16 @@ def floyd_warshall(graph, v):
updated to the next vertex[i][k].
>>> num_vertices = 3
>>> graph = [
... [float('inf'), float('inf'), float('inf')],
... [float('inf'), float('inf'), float('inf')],
... [float('inf'), float('inf'), float('inf')]
... [0, 3, float('inf')],
... [2, 0, float('inf')],
... [float('inf'), 7, 0]
... ]
>>> expected = [
... [0, 2, float('inf')],
... [1, 0, float('inf')],
... [float('inf'), float('inf'), 0]
... [0, 3, float('inf')],
... [2, 0, float('inf')],
... [9, 7, 0]
... ]
>>> dist, _ = floyd_warshall(graph, num_vertices)
>>> dist == expected

22
graphs/tests/test_graphs_floyd_warshall.py
View File

@ -18,24 +18,10 @@ def test_no_edges():
assert dist == expected
def test_example_input(capsys):
num_vertices = 3
graph = [
[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 = [
[0, 2, float("inf")],
[1, 0, float("inf")],
[float("inf"), float("inf"), 0],
]
dist, _ = floyd_warshall(graph, num_vertices)
_ = capsys.readouterr()
def test_with_edges():
graph = [[0, 3, float("inf")], [2, 0, float("inf")], [float("inf"), 7, 0]]
expected = [[0, 3, float("inf")], [2, 0, float("inf")], [9, 7, 0]]
dist, _ = floyd_warshall(graph, 3)
assert dist == expected