Talk:Dijkstra's algorithm: Difference between revisions

Content deleted Content added
Ehasl (talk | contribs)
Line 51:
== 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.[[SpecialUser:Contributions/129.241.229.8Ehasl|129.241.229.8Elias]] ([[User talk:129.241.229.8Ehasl|talk]]) 10:4849, 9 January 2020 (UTC)