⟩ What is the goal of the shortest distance algorithm?
The goal is completely fill the distance array so that for each vertex v, the value of distance[v] is the weight of the shortest path from start to v.
Human Resources
Tutorials
User
