How does Dijkstra's algorithm update the tentative distances of neighboring node

How does Dijkstra's algorithm update the tentative distances of neighboring nodes?

How does Dijkstra's algorithm update the tentative distances of neighboring nodes?

Step 1: Start with a graph that has nodes (points) and edges (connections between points). Each edge has a weight (cost or distance).
Step 2: Choose a starting node and set its tentative distance to 0 (since it's the starting point). Set all other nodes' tentative distances to infinity (unknown).
Step 3: Look at the current node and find all its neighboring nodes (nodes directly connected to it).
Step 4: For each neighboring node, calculate the tentative distance by adding the current node's tentative distance to the weight of the edge connecting them.
Step 5: If this new tentative distance is less than the previously recorded distance for that neighboring node, update the neighboring node's distance with this new value.
Step 6: Mark the current node as visited (it won't be checked again) and move to the unvisited node with the smallest tentative distance.
Step 7: Repeat steps 3 to 6 until all nodes have been visited.

Dijkstra's Algorithm – A graph search algorithm that finds the shortest path from a starting node to all other nodes in a weighted graph.
Tentative Distances – The current known shortest distance from the starting node to a given node, which is updated as the algorithm progresses.
Edge Weights – The values assigned to edges in a graph that represent the cost or distance to traverse from one node to another.