Update graphs/graphs_floyd_warshall.py

asmitannu · tianyizheng02 · web-flow · commit f1e09cd1af3a · 2025-01-08T21:59:49.000+05:30
Co-authored-by: Tianyi Zheng &lt;tianyizheng02@gmail.com&gt;
diff --git a/graphs/graphs_floyd_warshall.py b/graphs/graphs_floyd_warshall.py
@@ -1,4 +1,3 @@
-# floyd_warshall.py
 """
 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.

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,3 @@`
`1`		`-# floyd_warshall.py`
`2`	`1`	`"""`
`3`	`2`	`The problem is to find and return the shortest distance between all pairs of vertices`
`4`	`3`	`in a weighted directed graph that can have negative edge weights.`