Revision as of 21:14, 17 November 2024 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,586 edits →Add A Fact: "Dijkstra's algorithm proven universally optimal": oversold? ← Previous edit		Revision as of 17:33, 23 November 2024 edit undo Kkddkkdd (talk \| contribs) 405 edits No edit summary Next edit →
Line 80: :#you can only access the weights by pairwise comparisons, :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) ==Pseudocode== The pseudocode seems to be failed into an endless loop unless all vertices are connected. [[User:Kkddkkdd\|Kkddkkdd]] ([[User talk:Kkddkkdd\|talk]]) 17:32, 23 November 2024 (UTC)

Talk:Dijkstra's algorithm: Difference between revisions