Talk:Graph search algorithm
Trees are a subset of Graphs
[edit]Searching graphs is not the same thing as tree traversal, in that the latter is a subset of the former. Binary Search Trees (which is all tree traversal covers) are an even smaller subset of graphs, and making algorithms like A*, BFS, and DFS point to trees instead of graphs could mislead mislead people. A graph in computer science (that algorithms such as A* are used on) are no different than graphs in mathematics, and it'd be good if that were made more clear.