In cases where there are several shortest paths between two nodes (and edges have varying lengths), the most convenient among these paths is often the one with the fewest edges. We define best[u] = minimum number of edges in a shortest path from s to u

Give an efficient algorithm that, on input a weighted graph G = (V, E, w) with positive edge weights, and an origin node s V , computes best[u] for all u V .