kruscal求最小生成树-kruscal for minimum spanning tree 下载
|
最小生成树的Kruscal算法。Visual Studio2005- 下载
|
kruscal算法求最小生成树算法 欢迎大家使用-kruscal algorithm for the minimum spanning tree algorithm Everyone is welcome to use 下载
|
另一种有效的Kruscal算法,可以算20个点的情形-another effective Kruscal algorithm, can count 20 points of the case 下载
|
kruscal的源代码，实现最小生成树的算法，这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process. 下载
|
1.kruscal_CDT: 在Eclipse里面的CDT和MinGW(提供gcc)的环境下所编写的。 2.kruscal_VC2005: 在VC2005里面编写的。 3.以上两个的代码有点不同,区别主要在于compare函数 4.kruscal算法里面，我有两个不同的实现，一个是最小化堆里面放EdgeNode的指针，一个是最小化堆里面放EdgeNode的Object实例。前者使用了compare函数来比较大小，后者则是在EdgeNode的class里面重载运算符。-1.kruscal_CDT : in the Eclipse CDT inside and MinGW (provide gcc) and the environment under prepared. 2.kruscal_VC2005 : VC2005 inside prepared. 3. These two somewhat different from the code, between principal function is to compare 4.kruscal algorithm inside, I have two different implementations, 1 is the smallest of EdgeNode pile up inside the target, 1 is the smallest of EdgeNode pile up inside the Object examples. The former use the compare function to compare size, the latter is in the class inside EdgeNode Heavy Operators. 下载
|