二喵君的博客

参看资料：1》https://blog.youkuaiyun.com/u013480600/article/category/21332432》http://www.cnblogs.com/hanyulcf/archive/2010/10/23/tree_radius.html数的直径顾名思义，前提是“树”，即只有一个连通分量，树的直径是图中任意两点的最短距离；求解方法常采用两次BFS...

题目：Given a tree (a connected graph with no cycles), you have to find the farthest nodes in the tree. The edges of the tree are weighted and undirected. That means you have to find two nodes in the ...