Revision as of 14:30, 12 February 2015 edit Goolig (talk \| contribs) 1 edit →Proposed merge with Uniform-cost search ← Previous edit		Revision as of 15:21, 12 February 2015 edit undo Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits →Proposed merge with Uniform-cost search Next edit →
Line 56: * There is a difference between dijistra's algorithm and UCS. see: http://www.aaai.org/ocs/index.php/SOCS/SOCS11/paper/view/4017/4357 [[User:Goolig\|Goolig]] ([[User talk:Goolig\|talk]]) 14:27, 12 February 2015 (UTC) ** "The main difference is the identity of the nodes in the priority queue. In DA, all nodes are initially inserted into the queue. In UCS, nodes are inserted to the queue lazily during the search." Interestingly, this is not the case in the Mehlhorn and Sanders textbook (ref in article). There, the nodes are pushed onto the queue upon first visit. [[User:Qwertyus\|Q<small>VVERTYVS</small>]] <small>([[User talk:Qwertyus\|hm?]])</small> 15:21, 12 February 2015 (UTC)

Talk:Dijkstra's algorithm: Difference between revisions