Graph Traversal : BFS(Breadth First Search)

CSE { computer science & engineering } Video Lectures. In this Lecture you will be learning about the BFS (Breadth First Traversal). Breadth First Traversal (or Search) for a graph is similar to Breadth First Traversal of a tree (See method 2 of this post). The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. To avoid processing a node more than once, we use a boolean visited array. For simplicity, it is assumed that all vertices are reachable from the starting vertex. For more info / doubt write us at our mail or comment below. PLEASE LIKE , SHARE & SUBSCRIBE