文件名称:Kruskal-algorithm
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
使用克鲁斯卡尔算法生成最小生成树，将输入的边按照权值大小进行排列，每条边的端点属于不同的集合，当选取的一条边的两个端点同属于一个集合时，此边放弃。不属于同一个集合则合并。
-Use kruskal algorithm to generate the minimum spanning tree, the edge of the input according to the weight, size of each edge endpoints belong to different collections, elected to take an edge of two endpoints with belongs to a collection, this side to give up. Do not belong to the same collection is merged.
-Use kruskal algorithm to generate the minimum spanning tree, the edge of the input according to the weight, size of each edge endpoints belong to different collections, elected to take an edge of two endpoints with belongs to a collection, this side to give up. Do not belong to the same collection is merged.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Kruskal algorithm.cpp