Bellman–Ford algorithm: Revision history

Jump to navigation Jump to search

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

8 December 2025

  • curprev 18:0318:03, 8 December 2025 imported>David Eppstein 22,486 bytes 0 Undid revision 1326337915 by CastleHoney (talk) "slower" is more precise than "less efficient", and the new wording gives the impression the algorithm can handle graphs with all edge weights negative, only true for trees (on which Dijkstra actually does work)

25 August 2025

24 May 2025

  • curprev 11:3811:38, 24 May 2025 imported>Shycha m 22,643 bytes +22,643 Re-flow comments in the BellmanFord function. Without re-flowing some of the lines that contain comments are wrapped around, which reduces readability in standard text + standard width appearance.
Retrieved from "http://debianws.lexgopc.com/wiki143/index.php?title=Bellman–Ford_algorithm"