Talk:Dijkstra's algorithm: Difference between revisions

Revision as of 19:33, 17 October 2015

Revision as of 22:03, 11 January 2016

Line 68:

I performed the merge. ''AIMA'' and the Felner paper found by {{U|Goolig}} is used to explain the similarities and differences between UCS/Dijkstra. [[User:Qwertyus|Q<small>VVERTYVS</small>]] <small>([[User talk:Qwertyus|hm?]])</small> 20:27, 22 February 2015 (UTC)

== Description section of artice ==

In the second paragraph after the note, it says "This is done by determining the sum of the distance between an unvisited intersection and the value of the current intersection". There should be two intersections following between, but there is only one intersection since value is not an intersection.

The phrase, "This is done by determining the sum of the distance between an unvisited intersection and the value of the current intersection" should be changed to read, "This is done by adding the value of the current intersection to the distance between the current intersection and an unvisited intersection".