In Dijkstra's algorithm, how is the next node to process selected?

In Dijkstra's algorithm, how is the next node to process selected?

Step 1: Start with a list of all nodes in the graph.
Step 2: Assign a tentative distance value to every node. Set the initial node's distance to 0 and all others to infinity.
Step 3: Mark all nodes as unvisited. Set the initial node as the current node.
Step 4: For the current node, look at all its unvisited neighbors and calculate their tentative distances.
Step 5: If the calculated distance to a neighbor is less than its current tentative distance, update it.
Step 6: Once all neighbors have been considered, mark the current node as visited.
Step 7: Select the unvisited node with the smallest tentative distance as the next current node.
Step 8: Repeat steps 4 to 7 until all nodes have been visited.

No concepts available.