Which of the following is a valid implementation detail of Dijkstra's algorithm?
-
Using a depth-first search approach
-
Updating the distance of adjacent nodes only if they are visited
-
Using a priority queue to select the next node
-
Storing all nodes in a single array
