First, this paper analyzes degree-constraint minimum diameter spanning tree algorithm - the CT algorithm, and proposes the improved CT algorithm.
首先，本文有效的分析了度受限的最小直径生成树算法-CT算法，并提出了改进的CT算法。
Based on the logical structure of minimum spanning tree, a stability degree constraint model is established and the laying scheme is given.
在最小生成树逻辑结构上建立稳定性度约束模型，给出满足度约束的铺设方案。
Based on the logical structure of minimum spanning tree, a stability degree constraint model is established and the laying scheme is given.
在最小生成树逻辑结构上建立稳定性度约束模型，给出满足度约束的铺设方案。
应用推荐