|
|
|
BSF : Breadth First Search
|
In graph theory, breadth-first search (BFS) is a graph search algorithm that begins at the root node and explores all the neighboring nodes. Then for each of those nearest nodes, it explores their unexplored neighbor nodes, and so on, until it finds the goal.
created by syam1224 on 2008-04-23 21:30:20
|
|
|
|
Breadth First Search (BFS)
BFS starts at a given vertex, which is at level 0. In the first stage, we visit all vertices at level 1. In the second stage, we visit all vertices at second level. These new vertices, which are adjacent to level 1 vertices, and so on. The BFS traversal terminates when every vertex has been visited.
http://www.personal.kent.edu/~rmuhamma/Algorithms/
created by syam1224 on 2008-04-23 21:34:56
|
|
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
|
|
|
