Which of the following is useful in traversing a given graph by breadth-first search (BFS)?

Question

Accepted Answer

Correct answer: D — BFS explores vertices level by level, and a queue is used to store and process vertices in the order they are discovered.

Answer

A. Stack

Answer

B. Set

Answer

C. List

Answer

D. Queue

Which of the following is useful in traversing a given graph by breadth-first…