Give a linear-time algorithm to determine the longest unweighted path in an acyclic undirected graph (that is, a tree).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.