Breadth-First Search (BFS) uses a traversal strategy that visits nodes in a graph in breadthward motion and uses a queue to remember to get the next vertex to start a search when a dead end occurs in any iteration. Here are the steps:

1. Start by putting any one of the graph's vertices on top of a queue.
2. Take the top item of the queue and add it to the visited list.
3. Create a list of that vertex's adjacent nodes. Add the ones which aren't in the visited list to the top of the queue.
4. Keep repeating steps 2 and 3 until the queue is empty.

Question

Breadth-First Search (BFS) uses a traversal strategy that visits nodes in a graph in breadthward motion and uses a queue to remember to get the next vertex to start a search when a dead end occurs in any iteration. Here are the steps:

1. Start by putting any one of the graph's vertices on top of a queue.
2. Take the top item of the queue and add it to the visited list.
3. Create a list of that vertex's adjacent nodes. Add the ones which aren't in the visited list to the top of the queue.
4. Keep repeating steps 2 and 3 until the queue is empty.

Knowee AI · Accepted Answer

Breadth-First Search (BFS) uses a traversal strategy that visits nodes in a graph in breadthward motion and uses a queue to remember to get the next vertex to start a search when a dead end occurs in any iteration. Here are the steps:

1. Start by putting any one of the graph's vertices on top of a queue.
2. Take the top item of the queue and add it to the visited list.
3. Create a list of that vertex's adjacent nodes. Add the ones which aren't in the visited list to the top of the queue.
4. Keep repeating steps 2 and 3 until the queue is empty.

Which traversal strategy does BFS use?

Question

Solution

Similar Questions

Upgrade your grade with Knowee