Parallelizing BFS

Group- 32
M. Sri Charan- BL.EN.U4CSE19078
M. Girish Reddy- BL.EN.U4CSE19080
M. Ratan Reddy- BL.EN.U4CSE19084
BFS
• BFS stands for Breadth First Search. It is also known as level order
traversal. The Queue data structure is used for the Breadth First Search
traversal. When we use the BFS algorithm for the traversal in a graph,
we can consider any node as a root node.
Steps for BFS
• Step 1: Take an Empty Queue.
• Step 2: Select a starting node (visiting a node) and insert it into the
Queue.
• Step 3: Provided that the Queue is not empty, extract the node from
the Queue and insert its child nodes (exploring a node) into the Queue.
• Step 4: Print the extracted node.
Strategy for Parallelizing breadth-first-search