|
|
|
Breadth-first search from Wikipedia
|
BFS is an uninformed search method that aims to expand and examine all nodes of a graph systematically in search of a solution. In other words, it exhaustively searches the entire graph without considering the goal until it finds it. It does not use a heuristic.
http://en.wikipedia.org/wiki/Breadth-first_search
created by syam1224 on 2008-04-23 21:33:05
|
|
|
|
|
