Revision as of 12:51, 21 August 2022 edit Shrddr (talk \| contribs) 10 edits →Pseudocode improvement: Reply Tag: Reply ← Previous edit		Revision as of 11:25, 4 September 2022 edit undo WhyYouAskMe (talk \| contribs) 19 edits →Pseudocode is wrong: new section Tag: New topic Next edit →
Line 68: :The text before pseudocode box ends with reference to https://doi.org/10.1007%2F978-3-540-77978-0 which does mention infinity check (see "algorithm" at page 197). But then for some reason it's left out in "pseudocode" at page 198. [[User:Shrddr\|Shrddr]] ([[User talk:Shrddr\|talk]]) 12:51, 21 August 2022 (UTC) == Pseudocode is wrong == The pseudocode that uses a priority queue is plain wrong, it produces garbage. I used this instead and can confirm it works okay: https://stackabuse.com/courses/graphs-in-python-theory-and-implementation/lessons/dijkstras-algorithm/ [[User:WhyYouAskMe\|WhyYouAskMe]] ([[User talk:WhyYouAskMe\|talk]]) 11:25, 4 September 2022 (UTC)

Talk:Dijkstra's algorithm: Difference between revisions