Talk:Dijkstra's algorithm: Difference between revisions

Revision as of 23:58, 6 February 2015

Revision as of 13:53, 7 February 2015

Line 82:

* 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-->

::{{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)