Update graphs/graphs_floyd_warshall.py

asmitannu · cclauss · web-flow · commit d4bd7d7ced37 · 2024-12-19T19:14:39.000+04:00
Co-authored-by: Christian Clauss &lt;cclauss@me.com&gt;
diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
@@ -2,9 +2,6 @@
 """
 The problem is to find and return the shortest distance between all pairs of vertices
 in a weighted directed graph that can have negative edge weights.
-
-https://docs.python.org/3/library/doctest.html
-
 """
 
 
