Q15
What is the primary purpose of using a priority queue in graph algorithms like Dijkstra's?
A.
To store all edges of the graph.
B.
To maintain the order of vertices during BFS.
C.
To perform depth-first search more efficiently.
D.
To efficiently extract the vertex with the minimum distance.
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board