Revision as of 19:32, 22 August 2011 edit Kri (talk \| contribs) Extended confirmed users 9,434 edits m →Search vs. shortest path algorithms?: refrased ← Previous edit		Revision as of 08:31, 23 August 2011 edit undo Kri (talk \| contribs) Extended confirmed users 9,434 edits m →Search vs. shortest path algorithms?: changed word Next edit →
Line 112: == ''Search'' vs. ''shortest path'' algorithms? == The [[A]] algorithm is listed as a graph search algorithm, while [[Dijkstra's algorithm]], which in fact is a special case of the A algorithm, is listed as a shortest path ~~problem~~finder. But what is really the difference between search algorithms and shortest path algorithms? May I suggest a merge of the two sections? —[[User:Kri\|Kri]] ([[User talk:Kri\|talk]]) 19:31, 22 August 2011 (UTC)

Talk:List of algorithms: Difference between revisions