1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
Algorithm of BFS:‐
1) Choose v. Visit all neighbors of v that have not been visited.
2) For each visited vertex repeat the same process until all vertices were visited.
1. Enqueue the root node.
2. Dequeue a node and examine it.
a. If the element sought is found in this node, quit the search and
return a result.
b. Otherwise enqueue any successors (the direct child nodes) that
have not yet been discovered.
3. If the queue is empty, every node on the graph has been examined – quit
the search and return "not found".
4. Repeat from Step 2.
5. Exit.
Features of BFS:‐
Space complexity:
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 90 ‐