The time delay of a long-distance call can be determined by multiplying
a small fixed constant by the number of communication links on the telephone
network between the caller and callee. Suppose the telephone network
of a company named RT&T is a tree. The engineers of RT&T want
to compute the maximum possible time delay that may be experienced in
a long-distance call. Given a treeT, thediameterofTis the length of
a longest path between two nodes ofT. Give an efficient algorithm for
computing the diameter ofT.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here