Revision as of 07:32, 22 October 2010 edit Yobot (talk \| contribs) Bots 4,733,870 edits m →Time and space complexity: Cleaning Expand tags from talk page, please readd in article if needed, removed: {{expand}} using AWB (7310) ← Previous edit		Revision as of 19:31, 22 August 2011 edit undo Kri (talk \| contribs) Extended confirmed users 9,434 edits →Search vs. shortest path algorithms?: new section Next edit →
Line 109: It might be interesting to list the [[time complexity]] and [[space complexity]] for applicable algorithms, along the lines of [[Sorting_algorithm#Comparison_of_algorithms]]. -- [[User:Beland\|Beland]] ([[User talk:Beland\|talk]]) 16:36, 29 August 2010 (UTC) == ''Search'' vs. ''shortest path'' algorithms? == The [[A]] algorithm is listed as a graph search algorithm, while [[Dijkstra's algorithm]], which is in fact a special case of the A algorithm, is listed as a shortest path problem. 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