Question: In Dijkstra\'s algorithm, what does the priority queue store?
Options:
Correct Answer: Only unvisited vertices
Solution:
The priority queue in Dijkstra\'s algorithm stores only the unvisited vertices, allowing the algorithm to efficiently select the next vertex with the smallest tentative distance.