Talk:Dijkstra's algorithm: Difference between revisions

Revision as of 23:57, 6 February 2015

Revision as of 23:58, 6 February 2015

Line 81:

::Indeed, and in the context of [[branch and bound]], "best-first" also means guided by a cost estimate heuristic (see, e.g., [http://www.diku.dk/OLD/undervisning/2003e/datV-optimer/JensClausenNoter.pdf Clausen]). I've never seen Dijkstra's being called that before. [[User:Qwertyus|Q<small>VVERTYVS</small>]] <small>([[User talk:Qwertyus|hm?]])</small> 14:24, 7 November 2014 (UTC)

* Yes UCS is uninformed. And a best-first search does not mean it has to be informed / have a heuristic. The main difference between UCS and Dijkstra is that UCS is tree search and Dijkstra is graph search. e.g.: Therefore UCS doesn't need to check for cycles. The target for the algorithms is different. Besides that, they are the same. (Source: Me studying for AI Exam) <small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/84.150.115.11|84.150.115.11]] ([[User talk:84.150.115.11|talk]]) 23:57, 6 February 2015 (UTC)</small><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->