mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-18 09:10:16 +00:00
editing doctest
This commit is contained in:
parent
4a6fbdecd2
commit
e1ad21cd6a
|
@ -49,13 +49,13 @@ def floyd_warshall(graph, v):
|
|||
... [float('inf'), float('inf'), 0]
|
||||
... ]
|
||||
>>> 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
|
||||
>>> dist == expected
|
||||
True
|
||||
"""
|
||||
|
||||
|
|
Loading…
Reference in New Issue
Block a user