Revision as of 13:58, 6 November 2012 edit Glen Koundry (talk \| contribs) 2 edits →Finding multiple shortest paths: new section ← Previous edit		Revision as of 13:59, 6 November 2012 edit undo Glen Koundry (talk \| contribs) 2 edits →Finding multiple shortest paths Next edit →
Line 62: == 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)

Talk:Dijkstra's algorithm: Difference between revisions