Data Structure Algorithm, Programming, Dijkstras Algorithm, Bellman Ford Algorithm, Graph.
[edges(u, v, weight)] to find the shortest path for N-1 times [dist[v] = minimum(dist[v], distance[u] + weight)]. The rationale of running N-1 times is to guarantee that the algorithm has explored all possible paths up to N-1, the maximum potential length of the shortest route with N vertices,