Which of the following is a key step in Dijkstra's algorithm?

Which of the following is a key step in Dijkstra's algorithm?

Step 1: Start with a graph that has vertices (points) and edges (connections between points).
Step 2: Choose a starting vertex and set its distance to 0 (since it's the starting point).
Step 3: Set the distance of all other vertices to infinity (meaning they are not reachable yet).
Step 4: Look at the current vertex and check all its adjacent vertices (the ones directly connected to it).
Step 5: For each adjacent vertex, calculate the distance from the starting vertex to that adjacent vertex through the current vertex.
Step 6: If this calculated distance is less than the previously recorded distance for that adjacent vertex, update its distance.
Step 7: Mark the current vertex as visited (meaning you won't check it again).
Step 8: Move to the unvisited vertex with the smallest distance and repeat steps 4 to 7 until all vertices are visited.

No concepts available.