Let's test your knowledge. Fill in the missing part by typing it in.

Breadth-First Search (BFS) is a graph traversal algorithm that explores all the vertices of a graph in ___ order. It starts from a source vertex and visits all its neighboring vertices before moving on to their neighbors. BFS uses a ___ data structure to keep track of the vertices to be visited.

BFS can be applied to various problems in ___ and ___. One common application is navigation in a maze. By using BFS, we can find the shortest path between two points in a maze by exploring its cells in breadth-first order.

To implement BFS, we need a ___ data structure to store the cells to be visited. We start from a source cell and ___ it in the queue. While the queue is not empty, we ___ a cell, mark it as visited, and ___ its unvisited neighboring cells. We repeat this process until we reach the destination cell or the queue becomes empty. This guarantees that we visit all cells in the maze in breadth-first order.