Talk:Dijkstra's algorithm: Difference between revisions

Content deleted Content added
Line 48:
 
The main animation is very confusing. It purports to minimize distance, but in the triangle formed by nodes 1-3-6, the distance between nodes 1 and 6 is labelled as 14, while the distance from node 1 to 3 to 6 sums to 11, which is geometrically imnpossible by the nature of triangles. Visually, the path 1-6-5 is obviously the shortest distance. Either the labels of the distances between nodes should be changed (and therefore the optimal path changed) or the description should be changed to not refer to distance and make clear that the labels do not reference distance between nodes. Am I seeing this correctly? [[User:Voyaging|<span style="color:darkblue">'''''Voyaging'''''</span>]][[User talk:Voyaging|<sup><span style="color:darkred">'''talk'''</span></sup>]] 14:44, 11 July 2019 (UTC)
 
== Practical optimizations and infinite graphs ==
 
The pseudocode is a sort of Breadth-First Search, not Uniform-Cost Search, as it does not consider edge weight.[[Special:Contributions/129.241.229.8|129.241.229.8]] ([[User talk:129.241.229.8|talk]]) 10:48, 9 January 2020 (UTC)