Question: Which of the following is a valid implementation detail of Dijkstra\'s algorithm?

Options:

1. Using a depth-first search approach
2. Updating the distance of adjacent nodes only if they are visited
3. Using a priority queue to select the next node
4. Storing all nodes in a single array

Correct Answer: Using a priority queue to select the next node

Solution:

Dijkstra\'s algorithm uses a priority queue to efficiently select the next node with the smallest tentative distance.