Content deleted Content added
→Pronounciation of the inventors name: Corrected a spelling error in the title. |
→Any video of animation available?: Added a section. |
||
Line 22:
[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-->
== Terminological Dissonance? ==
The terminology in the caption for the animation is not in full agreement with the description of the algorithm: (a) the algorithm description does not mention a "tentative set" - it does mention "tentative distances", and it mentions an "unvisited set"; (b) the algorithm description mentions no "heuristic", but the caption to the animation says that the algorithm uses a "heuristic that is identically zero". At first it seemed to me that the caption of the animation intended "tentative set" to mean that which is meant by "unvisited set" in the algorithm description, but as I thought about it, I am unsure; on the other hand, it seems clear to me that even if that is not the intent of the caption, it '''does''' follow that the "tentative set" is identical to the "unvisited set" in that example. Matt Insall 13:15, 5 August 2017 (UTC)
== Description section of artice ==
| |||