Let G Undirected Graph Every U V E V G Let U Length Shoertest Path U V Diameler G Delined Q37055056

Let G be an undirected graph. For every u, v E V(G), let do(u, ) be the length of the shoertest path from u to v. The diameler of G is delined to be the maximum distance between any two pair of vertices In other words: (dolu,) Give an ellicient algorithm to compute the diameter of a graph. Explain the running time of your agorithm. Show transcribed image text

OR

 

OR