Revision as of 00:17, 10 January 2020 edit Lowercase sigmabot III (talk \| contribs) Bots, Page movers 2,448,909 edits m Archiving 2 discussion(s) to Talk:Dijkstra's algorithm/Archive 2) (bot ← Previous edit		Revision as of 09:14, 10 September 2020 edit undo 2a02:ed0:33b2:6c00:f5d1:308e:202d:179c (talk) →GIF is confusing: new section Next edit →
Line 39: The pseudocode is a sort of Breadth-First Search, not Uniform-Cost Search, as it does not consider edge weight.[[User:Ehasl\|Elias]] ([[User talk:Ehasl\|talk]]) 10:49, 9 January 2020 (UTC) == GIF is confusing == The gif of Dijkstra's implementation gives irrelevant information which is misleading and confusing - the values inside the nodes are pointless and contribute nothing to the understanding of the algorithm, while the excessive amount of information is confusing. A new gif with no values inside the nodes should be created.

Talk:Dijkstra's algorithm: Difference between revisions