Revision as of 08:01, 9 December 2024 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,586 edits →Add A Fact: "Dijkstra's algorithm proven universally optimal": Reply Tag: Reply ← Previous edit		Revision as of 21:43, 9 December 2024 edit undo Lfstevens (talk \| contribs) Extended confirmed users 70,679 edits →Add A Fact: "Dijkstra's algorithm proven universally optimal": Reply Tag: Reply Next edit →
Line 81: :then a specific version of Dijkstra (with a special priority queue) will get a number of comparisons within a constant factor of optimal. It's a nice result, and probably should be mentioned in this article ([[Dijkstra's algorithm]]) but I question the relevance to [[shortest path problem]] because it's about sorting rather than shortest paths per se. It may have been a bit oversold by Quanta. —[[User:David Eppstein\|David Eppstein]] ([[User talk:David Eppstein\|talk]]) 21:14, 17 November 2024 (UTC) ::[[User:Lfstevens]]: when adding this material, it would have been helpful for you to have read this thread. Your version of what they did is far too vague and hypey. I have edited it to more accurately reflect the claims of the new paper. —[[User:David Eppstein\|David Eppstein]] ([[User talk:David Eppstein\|talk]]) 08:01, 9 December 2024 (UTC) :::Thanks for noticing and fixing my mush. It was pretty much a pull from the Quanta piece. [[User:Lfstevens\|Lfstevens]] ([[User talk:Lfstevens\|talk]]) 21:43, 9 December 2024 (UTC) ==Pseudocode==

Talk:Dijkstra's algorithm: Difference between revisions