Try this exercise. Fill in the missing part by typing it in.

Dijkstra's Algorithm is an essential algorithm for finding the shortest path in weighted graphs. It is widely used in various applications including mapping software, networking, and robotic path planning.

The algorithm works by maintaining a list of distances from the source node to all other nodes in the graph. It starts with an initial distance of infinity for all nodes except the source node, which has a distance of 0.

The algorithm then iteratively selects the node with the smallest distance from the current set of unvisited nodes. It updates the distances of its neighbors by considering the weight of the connecting edges and the current shortest path distance.

Dijkstra's Algorithm is an example of a ___ algorithm that guarantees finding the optimal solution. It is often implemented using a priority queue to efficiently select the node with the smallest distance.