[https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm#/media/File:Dijkstra_Animation.gif That animation] does not work as described. The calculated cost as shown in the animation is 20, while the correct one based on the described procedure is 28 (or 26 if bidirectional [1])
[1]: http://rosettacode.org/wiki/Dijkstra's_algorithm#Java <small><span class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Ckorakidis|Ckorakidis]] ([[User talk:Ckorakidis|talk]] • [[Special:Contributions/Ckorakidis|contribs]]) 19:31, 17 October 2015 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
== Wrong pseudo-code ==
The pseudo code mentions this:
24 decrease-key ''v'' in ''Q''; ''// Reorder v in the Queue''
Then it mentions the same thing in the separate discussion of priority queue implementation:
19 PQ.decrease_priority(v,alt)
Obviously, the first mention is wrong and the pseudo-code is, instead of talking about a normal queue, talking about the the same thing as priority queue section. I can make the change but I think more knowledgeable person ought to do it.--[[Special:Contributions/115.113.118.50|115.113.118.50]] ([[User talk:115.113.118.50|talk]]) 07:12, 18 March 2014 (UTC)
== Relaxation condition? ==
The article starts talking about the "relaxation condition" without defining it; I don't think this is very clear but I don't feel confident about editing it. http://stackoverflow.com/questions/2592769/what-is-the-relaxation-condition-in-graph-theory sort of explains (external link) but I can't find a decent definition within Wikipedia. <span style="font-size: smaller;" class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/88.104.125.53|88.104.125.53]] ([[User talk:88.104.125.53|talk]]) 10:30, 12 April 2014 (UTC)</span><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->
