Question
A programmer needs shortest paths in unweighted graphs, and the chosen structure has the property that it typically uses a queue. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Breadth-First Search
Explanation:
Breadth-First Search fits because it supports shortest paths in unweighted graphs and it typically uses a queue.
Both clues point to this choice.
Leave a Reply