The algorithm does not finalize the destination label 7 at university immediately because there are still other uncircled vertices with smaller tentative distances that must be processed first. Specifically, vertex E has an uncircled label of 4, which is smaller than 7.
Conditions: The graph is being processed by Dijkstra's algorithm.; Vertices with circled labels are treated as already selected/settled.; Uncircled labels are still tentative candidates.; There exists at least one uncircled vertex with a label smaller than the target's current label.
The algorithm does not finalize the destination label 7 at university immediately because there are still other uncircled vertices with smaller tentative distances that must be processed first. Specifically, vertex E has an uncircled label of 4, which is smaller than 7.
Conditions: The graph is being processed by Dijkstra's algorithm.; Vertices with circled labels are treated as already selected/settled.; Uncircled labels are still tentative candidates.; There exists at least one uncircled vertex with a label smaller than the target's current label.