compute the shortest path from u to all network nodes using dijkstra’s algorithm. remember that d(r) represent the cost of the least-cost path from u to r as of this iteration of the algorithm, p(r) is the predecessor of r along the current least-cost path from u to r, n is the subset of nodes that definitely belong to their least-cost path to u.