Last, the partition algorithm which has been improved is proposed, meanwhile, the basic idea of Minimum Cost Spanning tree is presented.
最后，给出了改进的基于划分的聚类方法，以及其中涉及到的最小生成树算法的基本思想。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.
提出了一种针对无线传感器网络的路由协议，该路由采用最小传输成本生成树的数据汇聚机制。
Based on the characteristics of the wireless sensor networks, a data aggregation scheme of minimum transmission cost spanning tree is designed.
针对传感器网络的特点，提出了一种最小传输成本生成树的数据汇聚机制。
In this paper, considering the cost of the node degree, a Generalized Minimum Spanning Tree modal is presented.
本文考虑到节点度的代价问题，提出了广义最小生成树的概念，并分析了最小生成树在实际应用中的局限性。
In this paper, considering the cost of the node degree, a Generalized Minimum Spanning Tree modal is presented.
本文考虑到节点度的代价问题，提出了广义最小生成树的概念，并分析了最小生成树在实际应用中的局限性。
应用推荐