文件名称：poj数算实习tree解答
文件大小：3KB
文件格式：CPP
更新时间：2018-12-14 09:59:31
tree poj 数算实习
Give a tree with n vertices,each edge has a length(positive integer less than 1001). Define dist(u,v)=The min distance between node u and v. Give an integer k,for every pair (u,v) of vertices is called valid if and only if dist(u,v) not exceed k.