《Introduction to Algorithm》22.2-8

今天覆習看到一題,試着證明了一下,題目簡潔很有意思. The diameter of a tree T = (V,E) is defined as m a x u , v ∈ V δ ( u , v ) max_{u,v\in V}\delta(u,v) maxu,v∈V​δ(u,v) , that is, the largest of all shortest-path distances in

>>阅读原文<<