Talk:Graph traversal
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
This page should contain a summary of the graph search algorithms (completeness, optimality, space, time etc.) similar to the summary of all the sorting algorithms that exist on the sorting algorithm page.
Beam search
[edit]I guess Beam_search and Fringe_search can be added to the list. —Preceding unsigned comment added by 80.109.133.171 (talk) 09:57, 24 April 2009 (UTC)
Building this article
[edit]Thought I'd mention here that I'm currently attempting to exhume this article from its longtime "stub" status and into glorious notability. Mainly, I want to mention that the lack of citations is understood, and will be addressed once the ideas here are well organized and unoriginal enough to merit associating them with textbooks and whatnot. Feel free to lend a hand! --Frizzil (talk) 09:04, 21 October 2012 (UTC)
A Commons file used on this page or its Wikidata item has been nominated for deletion
[edit]The following Wikimedia Commons file used on this page or its Wikidata item has been nominated for deletion:
Participate in the deletion discussion at the nomination page. —Community Tech bot (talk) 19:24, 2 June 2023 (UTC)
