- By always selecting the unvisited node with the smallest …
- By always selecting the unvisited node with the smallest tentative distance as the current node, the algorithm incrementally builds the shortest paths.
- By always selecting the unvisited node with the smallest tentative distance as the current node, the algorithm incrementally builds the shortest paths.