PT07Z  Longest path in a tree
You are given an unweighted, undirected tree. Write a program to output the length of the longest path (from one node to another) in that tree. The length of a path in this case is number of edges we traverse from source to destination.
Input
The first line of the input file contains one integer N  number of nodes in the tree (0 < N <= 10000). Next N1 lines contain N1 edges of that tree  Each line contains a pair (u, v) means there is an edge between node u and node v (1 <= u, v <= N).
Output
Print the length of the longest path on one line.
Example
Input: 3 1 2 2 3 Output: 2
hide comments
yaswanth desu:
20180410 04:45:17
If any one having doubt regarding the root means, consider the below example


saiyaman_098:
20180409 20:48:03
What's the bfs+dp approach? 

imkiller:
20180323 13:00:02
Done using one DFS only .


rahuldcoder:
20180317 15:32:31
Why running two dfs solves the problem.I still do not get it. 

hsmfawaz:
20180314 03:02:36
Its a Tree diameter problem so you have 2 solutions to get AC with oneshot


hai_dee:
20180310 04:24:25
Yay AC in one go Python, using a single BFS + DP approach :D Fun problem! 

kartik_354:
20180202 14:22:24
the test cases of this question are weak..plz correct them..


bani_raheja:
20180103 21:25:31
First did it in around september when I had no knowledge of DP, by using two BFS. Did it again with dp in January. Trust me, you'd love the DP idea. It's much more reliable than 2 BFSs. 

aniket000:
20171229 19:39:00
@diptark_bose , you can take node 1 as the starting node for the first dfs (used to calculate the farthest node) as it must be present in every test case , then use farthest node as the starting node for the second dfs. 

aniket000:
20171229 19:35:15
just calculate the diameter of the tree, diameter1 is your longest path in the tree 
Added by:  ThanhVy Hua 
Date:  20070328 
Time limit:  0.181s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Coauthor Amber 