Floyd–Warshall algorithm: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

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

curprev 07:1207:12, 23 May 2025 2403:5809:d10c:0:25c7:69f9:1f3e:ffb0 talk 23,497 bytes +10 Fixed wording undo

curprev 14:3514:35, 22 May 2025 2403:5809:d10c:0:f1cd:35fa:e6f0:d710 talk 23,487 bytes −362 Fixed grammar, wording, complexity; removed tangential sentences undo

curprev 07:2407:24, 15 January 2025 David Eppstein talk contribs 23,849 bytes +363 rescue deadlink ref; standardize on cs1 undo Tag: citing a blog or free web host

curprev 17:1717:17, 8 January 2025 130.206.41.42 talk 23,486 bytes −1 →Pseudocode undo
curprev 17:1617:16, 8 January 2025 130.206.41.42 talk 23,487 bytes −39 →Pseudocode undo
curprev 17:1517:15, 8 January 2025 130.206.41.42 talk 23,526 bytes −15 →Pseudocode undo

curprev 14:4214:42, 3 January 2025 Aadirulez8 talk contribs m 23,541 bytes −9 v2.05 - Auto / Fix errors for CW project (Link equal to linktext) undo Tag: WPCleaner

curprev 07:2607:26, 30 December 2024 Remsense talk contribs 23,550 bytes −10 Reverted 1 edit by Adam El-Sawaf (talk): Not an improvement undo Tags: Twinkle Undo

curprev 10:3110:31, 12 December 2024 Adam El-Sawaf talk contribs m 23,560 bytes +10 No edit summary undo Tag: Reverted

curprev 21:1521:15, 26 November 2024 GDavidButler talk contribs 23,550 bytes +287 →Implementations undo Tag: possible conflict of interest

curprev 20:3520:35, 6 November 2024 Zontasticality talk contribs 23,263 bytes +62 note specific relation to kleene algorithm undo Tag: Visual edit

curprev 19:0719:07, 27 October 2024 Manoomin talk contribs 23,201 bytes +209 Added one citation and pulled in one existing citation for the "Time complexity" section, then removed the "Uncited section" template. The reason for adding a second source here is that it offers an alternative explanation of the same result. undo

curprev 14:5214:52, 25 October 2024 Citation bot talk contribs 22,992 bytes +2 Altered pages. Formatted dashes. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Graph algorithms | #UCB_Category 76/132 undo

curprev 19:5519:55, 12 October 2024 JJMC89 bot III talk contribs m 22,990 bytes −10 Moving Category:Algorithms in graph theory to Category:Graph algorithms per Wikipedia:Categories for discussion/Log/2024 October 4 undo Tag: Manual revert
curprev 02:2202:22, 12 October 2024 JJMC89 bot III talk contribs m 23,000 bytes +10 Moving Category:Graph algorithms to Category:Algorithms in graph theory per Wikipedia:Categories for discussion/Log/2024 October 4#Category:Graph algorithms undo Tag: Reverted

curprev 22:4022:40, 30 August 2024 2601:280:5001:1c90:c5f:46c9:8c2b:df9d talk 22,990 bytes 0 →Pseudocode undo Tag: Manual revert
curprev 22:2822:28, 30 August 2024 2601:280:5001:1c90:c5f:46c9:8c2b:df9d talk 22,990 bytes 0 →Pseudocode undo Tag: Reverted

curprev 17:3417:34, 3 August 2024 MovGP0 talk contribs 22,990 bytes +3 →Implementations: Fixing link to QuikGraph undo

curprev 21:4121:41, 1 June 2024 Wizmut talk contribs 22,987 bytes −74 shorten short description undo

curprev 14:5414:54, 27 April 2024 DreamsOfSoftRain talk contribs 22,830 bytes +43 added citations for the claim about complexity undo Tags: Visual edit Newcomer task Newcomer task: references

curprev 08:4008:40, 12 March 2024 HirowoWiki talk contribs 22,787 bytes +603 Restored revision 1200801899 by Ptrnext (talk): Non-constructive edit undo Tags: Twinkle Undo Mobile edit Mobile web edit
curprev 08:3808:38, 12 March 2024 5.116.156.123 talk 22,184 bytes −603 No edit summary undo Tags: Reverted possible vandalism Mobile edit Mobile web edit

curprev 08:1308:13, 30 January 2024 Ptrnext talk contribs m 22,787 bytes +16 →Comparison with other shortest path algorithms: +wl undo Tag: 2017 wikitext editor

curprev 05:0305:03, 4 January 2024 Materialscientist talk contribs m 22,771 bytes −17 Reverted edits by 45.249.79.233 (talk) (HG) (3.4.12) undo Tags: Huggle Rollback
curprev 05:0205:02, 4 January 2024 45.249.79.233 talk 22,788 bytes +17 →History and naming undo Tags: Reverted Visual edit

curprev 05:1905:19, 17 December 2023 RJFJR talk contribs 22,771 bytes +9 →Pseudocode {{Cite web|url=https://books.goalkicker.com/AlgorithmsBook/|title = Free Algorithms Book}}: move ref out of heading undo

curprev 12:5412:54, 15 November 2023 185.45.22.146 talk 22,762 bytes −7 →Algorithm undo
curprev 12:5312:53, 15 November 2023 185.45.22.146 talk 22,769 bytes +3 →Algorithm undo
curprev 12:5212:52, 15 November 2023 185.45.22.146 talk 22,766 bytes +39 →Algorithm undo

curprev 08:3808:38, 11 November 2023 Kageon talk contribs 22,727 bytes 0 →Pseudocode undo Tag: Manual revert
curprev 08:3608:36, 11 November 2023 Kageon talk contribs 22,727 bytes 0 →Pseudocode undo Tag: Reverted

curprev 01:2601:26, 9 November 2023 OAbot talk contribs m 22,727 bytes +20 Open access bot: doi updated in citation with #oabot. undo

curprev 09:5309:53, 29 October 2023 Aperfectnumber talk contribs 22,707 bytes +178 →Comparison with other shortest path algorithms: Clarifying the comparison between repeated Dijkstra and Floyd-Warshall undo

curprev 09:1009:10, 15 August 2023 OAbot talk contribs m 22,529 bytes +20 Open access bot: doi updated in citation with #oabot. undo

curprev 17:5317:53, 17 April 2023 7agonczi talk contribs m 22,509 bytes −6 →Algorithm: Omega is a lower bound, so saying "up to" makes little sense. Theta is a tight bound and captures the point better. undo
curprev 17:5217:52, 17 April 2023 7agonczi talk contribs 22,515 bytes +4 →Algorithm: A few of these statements where untrue. For instance, the algorithm does not compare all paths. It only compares paths that are guaranteed to be shortest paths up to the last edge. In fact, the number of paths described in the previous version is exponential, which would contradict the fact that Floyd-Warshall is polynomial. The same is true about "every combination of edges is tested", which is vague and implies and exponential number of steps. undo

curprev 04:1004:10, 27 March 2023 73.43.49.185 talk 22,511 bytes 0 →Pseudocode {{Cite web|url=https://books.goalkicker.com/AlgorithmsBook/|title = Free Algorithms Book}}: Fixing another bug (I think) in the pseudocode for the Path procedure undo
curprev 03:5803:58, 27 March 2023 73.43.49.185 talk 22,511 bytes +29 →Pseudocode {{Cite web|url=https://books.goalkicker.com/AlgorithmsBook/|title = Free Algorithms Book}}: I think the pseudocode is missing one line of code (see the line of code added) undo Tag: Visual edit: Switched

curprev 10:4610:46, 25 March 2023 BallardG talk contribs 22,482 bytes −28 →Pseudocode [11]: The pseudocode had a bug, tracking "next" nodes in shortest path tree instead of "prev" nodes. Next nodes are not unique, while prev nodes are. The updated pseudocode matches the reference now. undo Tag: Visual edit

curprev 04:0104:01, 2 March 2023 38.105.200.49 talk 22,510 bytes +18 add heading for pseudocode for easier reference undo

23 May 2025

22 May 2025

15 January 2025

8 January 2025

3 January 2025

30 December 2024

12 December 2024

26 November 2024

6 November 2024

27 October 2024

25 October 2024

12 October 2024

30 August 2024

3 August 2024

1 June 2024

6 May 2024

27 April 2024

12 March 2024

30 January 2024

4 January 2024

17 December 2023

15 November 2023

11 November 2023

9 November 2023

29 October 2023

15 August 2023

17 April 2023

27 March 2023

25 March 2023

24 March 2023

2 March 2023