子集和数问题 实现对图的最小生成树实现，通过此算法可以找到此图中连接所有点的最小生成树-Subset of several questions on the implementation of the minimum spanning tree implementation plans, the passage of this algorithm can find this chart connecting all points of the minimum spanning tree

ACM的算法参考书，涉及最短路径、最小生成树、网络流、可行遍性问题等-ACM Algorithm Book

基于遗传算法的最小生成树算法很好解决了常用二进制编码不能正确表达最小生成树的问题，其优点是：求解过程简单清晰，形象直观，快速有效，易于编程，且具有更广泛的适用性，在求解多节点网络的最小生成树时更能体现其计算速度快的优越性。-The minimum spanning tree algorithm based on genetic algorithm is very good to solve the common binary code that can not correctly express

最小生成树，适用范围是应用于图论知识的实际问题，具体内容可上网查询-minimum spanning tree ,can be used for graph theory

多目标蚁群算法用来求解多目标最小生成树问题(Multi-objective ant colony algorithm)