The following is an algorithm for a(n) ____.
Take an arbitrary start vertex, mark it identified and place it in a queue.
While the queue is not empty
Take a vertex, u, out of the queue and visit u.
For all vertices, v, adjacent to this vertex u
If v has not been identified or visited
Mark it identified
Insert vertex v into the queue.
We are now finished visiting u.
A) depth-first search
B) linear search
C) breadth-first search
D) binary search

Question

Quizplus · Accepted Answer

This algorithm describes the process of a breadth-first search (BFS), which uses a queue to explore vertices level by level, ensuring that all vertices at the current level are explored before moving to the next level.

The Following Is an Algorithm for A(n) ____