===Just implemented the pseudocode for [http://rosettacode.org/wiki/Dijkstra%27s_algorithm#Python Rosetta Code] and found these issues===
Action decrease-key v in Q at line 24 should be omitted if Q is a set as stated in line 9. The wp back-tracking pseudocode also misses a final insert of u at the beginning of S that must occur after exiting the while loop. --[[User:Paddy3118|Paddy]] ([[User talk:Paddy3118|talk]]) 21:12, 21 December 2012 (UTC)
== Finding multiple shortest paths ==
In order to find all shortest paths between two nodes, I believe that the "if alt < dist[v]:" should be changed to "if alt <= dist[v]:".[[User:Glen Koundry|Glen Koundry]] ([[User talk:Glen Koundry|talk]]) 13:59, 6 November 2012 (UTC)
== Syntax higlight ==
I've modified the pseudocode in my sandbox to make it use syntax highlight. I think the language it resembles the most is Fortran, but maybe is not the case. Do you think that this makes it more understandable?
http://en.wikipedia.org/wiki/User:WLoku/sandbox <small><span class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:WLoku|WLoku]] ([[User talk:WLoku|talk]] • [[Special:Contributions/WLoku|contribs]]) 14:52, 9 November 2012 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
: I prefer boldfaced keywords over the pale yellowish colour. The automatic syntax highlight isn't correct either (e.g. the "for each" isn't highlighted). —''[[User:Ruud Koot|Ruud]]'' 23:00, 9 November 2012 (UTC)
