文件名称:zuixiaoshengchengshu
介绍说明－－下载内容均来自于网络，请自行研究使用
最小生成树算法,有n个城市可以用（n-1）条路将它们连通，求最小总路程的和。最小生成树算法，如Prim、Kruskal算法编写最小生成树程序输出最小生成树的各条边-Minimum spanning tree algorithm, there are n cities can use the (n-1) road will connect them, and find the smallest total distance. Respective sides of the minimum spanning tree algorithm, such as Prim, Kruskal minimum spanning tree algorithm to write the output of the minimum spanning tree program
(系统自动生成,下载前可以参看下载内容)
下载文件列表
zuixiaoshengchengshu.cpp