Content deleted Content added
Proposing to merge Uniform-cost search into Dijkstra's algorithm (TW) |
→Proposed merge with Uniform-cost search: Support merge |
||
Line 82:
Ping {{U|Kri}}, {{U|David Eppstein}}. [[User:Qwertyus|Q<small>VVERTYVS</small>]] <small>([[User talk:Qwertyus|hm?]])</small> 10:36, 7 November 2014 (UTC)
*'''Support:''' If ''Dijkstra's algorithm'' is so broad that it includes UCS (which it seems like it does in some cases) it feels unnecessary to have two articles for them.
:It's funny—in the paper ''Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment'' which you linked to they refer to Dijkstra's algorithm as a [[best-first search]]. I thought a best-first search was a kind of informed search, i.e. a search that is equipped with a [[Heuristic (computer science)|heuristic]], but looking in Russell and Norvig, it seems that this is not necessarily true either (although it is in most cases). It seems that it is very easy to have preconceptions when it comes to terminology of different algorithms. —[[User:Kri|Kri]] ([[User talk:Kri|talk]]) 13:54, 7 November 2014 (UTC)
| |||