mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-18 17:20:16 +00:00
editing doctest
This commit is contained in:
parent
650f3cf6e1
commit
4a6fbdecd2
|
@ -50,6 +50,12 @@ def floyd_warshall(graph, v):
|
||||||
... ]
|
... ]
|
||||||
>>> dist, _ = floyd_warshall(graph, num_vertices)
|
>>> dist, _ = floyd_warshall(graph, num_vertices)
|
||||||
>>> dist == expected
|
>>> dist == expected
|
||||||
|
|
||||||
|
The shortest path matrix using Floyd Warshall algorithm
|
||||||
|
|
||||||
|
0 2 INF
|
||||||
|
1 0 INF
|
||||||
|
INF INF 0
|
||||||
True
|
True
|
||||||
"""
|
"""
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user