Shortest path problem: 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 20:0920:09, 30 May 2024‎ Avyanna.Owam talk contribs‎ 41,463 bytes 0‎ Changed grammar and tone undo Tags: Visual edit Mobile edit Mobile web edit Newcomer task Newcomer task: references

curprev 09:5309:53, 19 May 2024‎ Agent VII talk contribs‎ 41,463 bytes +279‎ →‎Definition undo Tags: Visual edit: Switched Newcomer task Newcomer task: references

curprev 17:3417:34, 13 May 2024‎ 46.253.36.102 talk‎ 41,184 bytes +1‎ →‎Partial observability undo Tags: Mobile edit Mobile web edit

curprev 19:3619:36, 28 April 2024‎ 2001:67c:10ec:578f:8000::10b talk‎ 41,183 bytes +256‎ →‎Directed graphs with arbitrary weights without negative cycles undo

curprev 22:3722:37, 26 April 2024‎ IntGrah talk contribs‎ 40,927 bytes +19‎ →‎Algorithms: Replace 'most important' undo

curprev 20:0720:07, 6 April 2024‎ Waxworker talk contribs‎ 40,908 bytes −3‎ Undid revision 1217571314 by Ppeeeddgjl (talk) unexplained change undo Tag: Undo
curprev 16:4416:44, 6 April 2024‎ Ppeeeddgjl talk contribs‎ 40,911 bytes +3‎ No edit summary undo Tags: Reverted Mobile edit Mobile web edit

curprev 00:0500:05, 15 March 2024‎ 12.180.96.190 talk‎ 40,908 bytes +801‎ →‎Directed graphs with arbitrary weights without negative cycles undo Tag: Visual edit

curprev 19:1919:19, 24 January 2024‎ 2003:ca:a713:f3fc:7c85:1484:b4c7:6fdc talk‎ 40,107 bytes −14‎ →‎Directed graph: I changed one index for better representation undo

curprev 21:2221:22, 21 December 2023‎ 2a01:e34:ec12:d00:2113:934e:50f9:fd6b talk‎ 40,121 bytes +2‎ →‎Directed graphs with nonnegative weights undo

curprev 19:5019:50, 17 December 2023‎ Headbomb talk contribs‎ 40,119 bytes −303‎ →‎Directed graph: | Alter: template type. Add: class, eprint. Removed parameters. Some additions/deletions were parameter name changes. | Use this tool. Report bugs. | #UCB_Gadget undo

curprev 13:0313:03, 9 December 2023‎ 2a01:e34:ec12:d00:d1f3:e912:f9f7:a100 talk‎ 40,422 bytes +1‎ →‎Directed graphs with nonnegative weights undo

curprev 20:0520:05, 30 November 2023‎ Citation bot talk contribs‎ 40,421 bytes +13‎ Alter: title, template type. Add: chapter, s2cid. Removed parameters. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | #UCB_webform_linked 500/1304 undo

curprev 13:0613:06, 13 November 2023‎ Citation bot talk contribs‎ 40,408 bytes +60‎ Add: s2cid, isbn, pages, authors 1-1. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | #UCB_webform_linked 426/763 undo

curprev 09:5709:57, 10 November 2023‎ 115.240.130.46 talk‎ 40,348 bytes −21‎ deinition undo Tags: Manual revert references removed
curprev 09:5609:56, 10 November 2023‎ 115.240.130.46 talk‎ 40,369 bytes +21‎ test undo Tag: Reverted
curprev 09:5509:55, 10 November 2023‎ 115.240.130.46 talk‎ 40,348 bytes +1‎ deinition undo Tag: Manual revert
curprev 09:5309:53, 10 November 2023‎ 115.240.130.46 talk‎ 40,347 bytes −1‎ deinition undo Tag: Reverted

curprev 19:1719:17, 7 November 2023‎ OAbot talk contribs‎ m 40,348 bytes +35‎ Open access bot: doi, arxiv updated in citation with #oabot. undo

curprev 16:1616:16, 30 October 2023‎ 192.114.91.211 talk‎ 40,313 bytes +2‎ The cost of doing quantum minimum finding is sqrt(n)*log(n) and thus the cost of performing a (naive) distance product matrix multiplication is n^2.5*log(n) where |V| = n and we need to perform this log(n) times (see chapter 25 of intro to algorithms by Cormen the first algorithm of that chapter in the third edition of the book). undo

curprev 02:5202:52, 29 October 2023‎ ElegiaLi talk contribs‎ 40,311 bytes 0‎ →‎Directed graphs with arbitrary weights without negative cycles: typo undo
curprev 02:5002:50, 29 October 2023‎ ElegiaLi talk contribs‎ m 40,311 bytes +39‎ Correct cite type undo Tags: harv-error references removed

curprev 23:2523:25, 28 October 2023‎ User-duck talk contribs‎ 40,272 bytes +66‎ Cite CE. Move unused source to Further reading. undo
curprev 16:3616:36, 28 October 2023‎ User-duck talk contribs‎ 40,206 bytes −104‎ Cite CE. undo
curprev 10:2410:24, 28 October 2023‎ ElegiaLi talk contribs‎ m 40,310 bytes +500‎ Add new near-linear time algorithm for arbitrary weight undo Tag: Visual edit

curprev 21:3721:37, 25 October 2023‎ Citation bot talk contribs‎ 39,810 bytes +17‎ Add: s2cid, arxiv, authors 1-1. Removed proxy/dead URL that duplicated identifier. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | #UCB_CommandLine undo

curprev 07:5407:54, 17 October 2023‎ Quantumly talk contribs‎ m 39,793 bytes 0‎ Bellman-Ford has VE and so it makes sense to keep it VE instead of EV undo

curprev 16:1916:19, 16 October 2023‎ Quantumly talk contribs‎ m 39,793 bytes 0‎ n should be V here aswell undo
curprev 09:5509:55, 16 October 2023‎ Quantumly talk contribs‎ m 39,793 bytes 0‎ 2.5 looks slightly better than 5/2 undo
curprev 09:4909:49, 16 October 2023‎ Quantumly talk contribs‎ m 39,793 bytes −1‎ Fixed the undefined "n" in the running time of williams method. undo Tag: Visual edit: Switched
curprev 09:3909:39, 16 October 2023‎ Quantumly talk contribs‎ 39,794 bytes +774‎ The trivial O(V^(2.5)) quantum algorithm for APSP. undo Tag: Visual edit

curprev 17:4217:42, 15 October 2023‎ BattyBot talk contribs‎ 39,020 bytes +24‎ Fixed reference date error(s) (see CS1 errors: dates for details) and AWB general fixes undo Tag: AWB
curprev 17:2317:23, 15 October 2023‎ Quantumly talk contribs‎ m 38,996 bytes −1‎ fixed the square root to also include v undo
curprev 17:0417:04, 15 October 2023‎ Quantumly talk contribs‎ 38,997 bytes +506‎ Quantum search on a native implementation of Dijkstra's algorithm yields improved running time, provided a quantum computer. Note that this can also be included in the APSP problem with simply performing it on all V vertices. undo Tag: Visual edit: Switched

curprev 18:0318:03, 4 October 2023‎ NowIKnow79 talk contribs‎ m 38,491 bytes +36‎ →‎Definition: Defining the set E undo Tag: Visual edit: Switched

curprev 15:0815:08, 19 September 2023‎ David Eppstein talk contribs‎ 38,455 bytes −461‎ Undid revision 1176105686 by Anonymmouseee (talk) refspam undo Tag: Undo
curprev 14:2114:21, 19 September 2023‎ Anonymmouseee talk contribs‎ m 38,916 bytes +461‎ Added reference to journal article about Algorithm Design undo Tags: Reverted Visual edit Newcomer task Newcomer task: references

curprev 10:1810:18, 14 August 2023‎ OAbot talk contribs‎ m 38,455 bytes +16‎ Open access bot: doi updated in citation with #oabot. undo

curprev 05:4005:40, 22 July 2023‎ Citation bot talk contribs‎ 38,439 bytes −48‎ Alter: title, template type. Add: chapter, authors 1-1. Removed proxy/dead URL that duplicated identifier. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | #UCB_CommandLine undo

curprev 11:3411:34, 3 June 2023‎ ActivelyDisinterested talk contribs‎ 38,487 bytes +57‎ →‎Bibliography: Resolving Category:Harv and Sfn no-target errors. Added sfn whitelist to suppress false positives undo

curprev 20:4620:46, 28 March 2023‎ 78.84.112.143 talk‎ 38,430 bytes +23‎ I have clarified weights type from the referred research undo Tag: Visual edit

curprev 23:0323:03, 27 February 2023‎ Vozul talk contribs‎ 38,407 bytes +5‎ Replaced bloated sidebar with new navbox undo

curprev 15:2015:20, 20 February 2023‎ Citation bot talk contribs‎ 38,402 bytes −38‎ Removed proxy/dead URL that duplicated identifier. | Use this bot. Report bugs. | Suggested by AManWithNoPlan | #UCB_CommandLine undo

curprev 13:0513:05, 11 February 2023‎ Citation bot talk contribs‎ 38,440 bytes −86‎ Removed proxy/dead URL that duplicated identifier. Removed parameters. | Use this bot. Report bugs. | Suggested by Corvus florensis | #UCB_webform 2284/3499 undo

curprev 01:3801:38, 30 January 2023‎ OAbot talk contribs‎ m 38,526 bytes +44‎ Open access bot: doi added to citation with #oabot. undo

curprev 18:5918:59, 2 January 2023‎ David Eppstein talk contribs‎ 38,482 bytes −2,615‎ Undo. Unsourced original research, seriously misleading in two ways: (1) it calls it "linear programming" but it is ILP, (2) ILP should not be used when there is an easy LP formulation. undo Tag: Undo
curprev 15:2115:21, 2 January 2023‎ BoostBack talk contribs‎ m 41,097 bytes +12‎ Improved the flow between the two LP paragraphs undo Tags: Reverted Visual edit
curprev 15:0915:09, 2 January 2023‎ BoostBack talk contribs‎ m 41,085 bytes +2,603‎ Clarified the derivation of the LP from the ILP. Not sure how to properly format or cite the rest of my proposed changes (see the talk page I created on the LP section). undo Tags: Reverted Visual edit

curprev 06:0006:00, 10 December 2022‎ David Eppstein talk contribs‎ 38,482 bytes −2,481‎ →‎Linear programming formulation: remove whole section, unsourced and the wrong way to formulate this as an LP undo
curprev 05:5905:59, 10 December 2022‎ David Eppstein talk contribs‎ 40,963 bytes −120‎ No, it doesn't. Shortest path is just a standard LP. Find distances from start to all vertices minimizing sum of distances such that for each edge x→y, dist(y) ≤ dist(x) + length(x→y). No integer requirements anywhere. undo Tag: Undo

30 May 2024

19 May 2024

13 May 2024

28 April 2024

26 April 2024

6 April 2024

15 March 2024

24 January 2024

21 December 2023

17 December 2023

9 December 2023

30 November 2023

13 November 2023

10 November 2023

7 November 2023

30 October 2023

29 October 2023

28 October 2023

25 October 2023

17 October 2023

16 October 2023

15 October 2023

4 October 2023

19 September 2023

14 August 2023

22 July 2023

3 June 2023

28 March 2023

27 February 2023

20 February 2023

11 February 2023

30 January 2023

2 January 2023

10 December 2022