Template talk:Graph search algorithm

From Wikipedia, the free encyclopedia

[edit] Suggested renaming

Since all of the algorithms in this box can be applied (with slight modifications) to general graphs, and are often used in this way, I move that this box be renamed and retitled "Graph search algorithms" and that a summary article be created at Graph search algorithm. Tree traversal discusses some of these, but I think a more general treatment that discusses commonalities of depth-first search, breadth-first search, A* search, etc. in a central place is in order. The existence of this box suggests the need for such a "main article." What do you think? Deco 00:20, 20 April 2006 (UTC)