Revision as of 00:18, 28 December 2017 edit Lowercase sigmabot III (talk \| contribs) Bots, Page movers 2,448,927 edits m Archiving 2 discussion(s) to Talk:Dijkstra's algorithm/Archive 2) (bot ← Previous edit		Revision as of 06:04, 21 February 2018 edit undo Botlord (talk \| contribs) 33 edits →Is the algorithm description incorrect?: new section Next edit →
Line 35: since <math>T_\mathrm{dk} = \Theta(1)</math> for Fibonacci heaps. Hence I am reverting the complexity with Fibonacci heaps back to <math>O(\|E\| + \|V\| \log\|V\|)</math>. -- [[User:Paddu\|Paddu]] ([[User talk:Paddu\|talk]]) 15:44, 27 December 2017 (UTC) == Is the algorithm description incorrect? == Step six of the algorithm section is: "6. Otherwise, select the unvisited node that is marked with the smallest tentative distance, set it as the new "current node", and go back to step 3." I don't believe that's correct. Shouldn't the "tentative" be removed? Since this is an important article I wanted to be sure I was correct before editing it, but if it is incorrect [https://www.youtube.com/watch?v=gdmfOwyQlcI&t=20s we've already hit citogenesis]. [[User:Botlord\|Botlord]] ([[User talk:Botlord\|talk]]) 06:04, 21 February 2018 (UTC)

Talk:Dijkstra's algorithm: Difference between revisions