Let G = (V,E) be an undirected graph. For two vertices u and v in G, the distanc

Question

Let G = (V,E) be an undirected graph. For two vertices u and v in G, the distance from u to v, written d(u,v), is the length of a path with the fewest number of edges from u to v. If no path exists from u to v, then d(u,v) = ?. For a vertex s in G, we define the radius of G with respect to s RG(s) = max{d(s,u) | u ? V}. Informally, the radius of G with respect to s is the longest distance from s to any other vertex in G. Give an O(|V | + |E|) time algorithm that, given a vertex s, computes RG(s).

Explanation / Answer

please visit http://www.math.northwestern.edu/~mlerma/courses/cs310-05s/notes/dm-graphs please rate me

Related Questions

Navigate

• Browse (All)
• Browse L
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.