文件名称:Minimum-spanning-tree
介绍说明－－下载内容均来自于网络，请自行研究使用
给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价-The distance between the network to set a region of n cities, Prim' s algorithm or Kruskal' s algorithm to create a minimum spanning tree, and the calculation of the cost of the minimum spanning tree
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Minimum spanning tree.txt