Revision as of 06:04, 21 February 2018 edit Botlord (talk \| contribs) 33 edits →Is the algorithm description incorrect?: new section ← Previous edit		Revision as of 06:26, 21 February 2018 edit undo Alexey Muranov (talk \| contribs) Extended confirmed users 845 edits →Is the algorithm description incorrect?: reply Next edit →
Line 45: [[User:Botlord\|Botlord]] ([[User talk:Botlord\|talk]]) 06:04, 21 February 2018 (UTC) : It is the smallest among all the "tentative distances". While it is true that for the node with the smallest one, it is also the real distance, it is probably not so for the others, and even for that one it requires a proof, which will only be given after the algorithm has been described. --[[User:Alexey Muranov\|Alexey Muranov]] ([[User talk:Alexey Muranov\|talk]]) 06:25, 21 February 2018 (UTC)

Talk:Dijkstra's algorithm: Difference between revisions