Revision as of 13:59, 6 November 2012 edit Glen Koundry (talk \| contribs) 2 edits →Finding multiple shortest paths ← Previous edit		Revision as of 14:52, 9 November 2012 edit undo WLoku (talk \| contribs) 10 edits →Syntax higlight: new section Next edit →
Line 63: 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

Talk:Dijkstra's algorithm: Difference between revisions