FreeTree
于 2013-10-29 发布
文件大小:3615KB
0 206
下载积分: 1
下载次数: 12
代码说明：
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
下载说明：请别用迅雷下载，失败请重下，重下不扣分！
发表评论
