Question: What is the first step in Dijkstra\'s algorithm?

Options:

1. Select the node with the smallest tentative distance
2. Initialize all distances to infinity
3. Mark all nodes as unvisited
4. Add all edges to the priority queue

Correct Answer: Initialize all distances to infinity

Solution:

The first step is to initialize the distance to the source node as 0 and all other nodes as infinity.