Revision as of 00:04, 9 February 2015 edit Lowercase sigmabot III (talk \| contribs) Bots, Page movers 2,448,799 edits m Archiving 2 discussion(s) to Talk:Dijkstra's algorithm/Archive 1) (bot ← Previous edit		Revision as of 14:30, 12 February 2015 edit undo Goolig (talk \| contribs) 1 edit →Proposed merge with Uniform-cost search Next edit →
Line 54: ::{{Re\|84.150.115.11}} Russell and Norvig don't present UCS as a tree-only search algorithm. They present it as one strategy for filling in their Tree-Search and Graph-Search skeletons. [[User:Qwertyus\|Q<small>VVERTYVS</small>]] <small>([[User talk:Qwertyus\|hm?]])</small> 13:53, 7 February 2015 (UTC) * 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)

Talk:Dijkstra's algorithm: Difference between revisions