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'.
The rule is to select the uncircled vertex with the smallest tentative distance label. This vertex is then circled to mark it as settled, and a predecessor arrow is drawn from the vertex that supplied this smallest distance.
Conditions: There are uncircled vertices with assigned distance labels.; The algorithm is in the selection phase after updating neighbors.
The rule is to select the uncircled vertex with the smallest tentative distance label. This vertex is then circled to mark it as settled, and a predecessor arrow is drawn from the vertex that supplied this smallest distance.
Conditions: There are uncircled vertices with assigned distance labels.; The algorithm is in the selection phase after updating neighbors.