The initialization step involves assigning a distance of 0 to the starting vertex (home) and marking it as visited by drawing a circle around it. All other vertices are initially considered to have an infinite or undefined distance until they are updated by neighbor calculations.
Conditions: The algorithm is starting.; The source vertex is identified as 'home'.
The initialization step involves assigning a distance of 0 to the starting vertex (home) and marking it as visited by drawing a circle around it. All other vertices are initially considered to have an infinite or undefined distance until they are updated by neighbor calculations.
Conditions: The algorithm is starting.; The source vertex is identified as 'home'.
To update the neighbors, you calculate the total distance from the source to each unvisited neighbor by adding the edge weight to the current circled vertex's distance. You then write these new distances next to the neighbors.
Conditions: There is a current circled (settled) vertex.; The vertex has neighbors that are not yet circled.; Edge weights are known and non-negative.
To update the neighbors, you calculate the total distance from the source to each unvisited neighbor by adding the edge weight to the current circled vertex's distance. You then write these new distances next to the neighbors.
Conditions: There is a current circled (settled) vertex.; The vertex has neighbors that are not yet circled.; Edge weights are known and non-negative.