|
|
|
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
|
|
|
|
|
