搜索资源列表
Kruskal.cpp
- 在权值不同的图中寻找一个最小生成树的问题-different weights in the map to find a minimum spanning tree problem
kruskal最小生成树实现
- 在boost基础上实现 对图的最小生成树实现，通过此算法可以找到此图中连接所有点的最小生成树。-the boost on the basis of the plan to achieve the minimum spanning tree, the algorithm can find this map connect all the points the minimum spanning tree.
Kruskal_gao
- Kruskal算法寻找最小生成树,C语言实现，有完整的注释！-Kruskal finding minimum spanning tree algorithm, C Language, a complete Notes!
最小生成树程序
- 最小生成树程序。使用克鲁斯卡尔(Kruskal)算法，使用dephi编写。-minimum spanning tree procedures. Use Kelushikaer (Kruskal) algorithm, dephi prepared.
kruskal_matlab
- 最小生成树的kruskal算法 自己写的 要是再说有重复 我可就怒了-the Kruskal minimum spanning tree algorithm wrote it myself if I say that there is no duplication of anger on
7_7Kruskal
- 最小生成树的经典算法——Kruskal算法。用C++实现-minimum spanning tree algorithm classic -- Kruskal algorithm. C to achieve
mintree(C)
- kruskal算法的c语言版本，里面的中文用拼音，程序易于理解，是理解kruskal算法的一个好程序-Kruskal Algorithm c language version, the Chinese inside using phonetic symbols, the program is easier to understand, Kruskal understanding is a good algorithm procedures
MaxSpanningTree
- 求最大生成树，实际上是以最小生成树的算法为基础进行改进，我采用的是kruskal算法，基本思路是对各个边的权进行排序，然后加入生成树，形成环的点跳过，直到生成最大生成树。JAVA的特点是输入输出比较便利，所以问题的关键在于用监控将图的初始化和树的生成衔接。-Spanning Tree for the largest, is actually the minimum spanning tree algorithm-based improvement, I used the Kruskal algo
Kru
- Kruskal算法，Kruskal算法的时间复杂度为 ，与图中边数有关，而与图中的顶点数无关，因此该算法适合与求边稀疏的网的最小生成树。-Kruskal algorithm, the algorithm Kruskal time complexity of, and chart the edge, with map unrelated to the number of vertices, and the algorithm for edge for the sparse network of m
Dts.359-1.Kruskal
- kruskal算法的C++源码，即求加权连通图的最小生成树的算法。-c++ source of kruskal algorithm.
kruskal-algorithm
- kruskal algorithm program. any question please give me advice-it is a kruskal algorithm
Kruskal
- kruskal算法是一种求加权连通图的最小生成树的算法。-kruskal algorithm is a weighted connected graph minimum spanning tree algorithm.
kruskal
- Kruskal s algorithm in matlab code. Algorithm with Computational complexity theory.
kruskal
- l algorithme de Kruskal
Kruskal.m
- This code consists of the example of Kruskal s algorithm to find the minimum-spanning-tree which connects all the nodes through the edge with the least minimum edge values without creating the cycle.
kruskal
- 无向图最小生成树,kruskal算法,邻接表形式,复杂度O(mlogm)-Undirected graph minimum spanning tree, kruskal algorithm, adjacency table form, complexity O (mlogm)
Kruskal
- Kruskal Algorithm by Visual C++. Input Node and Line, and input value of lines
自来水管道架设问题
- 自来水管道架设问题 【问题描述】 若要在八个居民区（A区、B区、C区、D区、E区、F区、G区、H区）之间架设自来水管道，如何以最低的经济代价架设这个自来水管道。 【基本要求】 利用二种方法Prim算法和克鲁斯卡尔Kruskal算法生成自来水管道的架设方案(Two methods, Prim algorithm and Cruise Carle Kruskal algorithm are used to generate the water pipe erection scheme)
Prim+Kruskal 算法求最小生成树
- C语言 Prim Kruskal 算法求最小生成树(C language Prim+Kruskal algorithm for minimum spanning tree)
图论算法及其MATLAB程序代码
- 常用图论算法及其MATLAB程序代码： 1.最短路的Warshall-Floyd算法 2.最小生成树Kruskal避圈法 3.二部图G的最大匹配的算法(匈牙利算法)(The commonly used graph theory algorithm and its MATLAB program code: 1. shortest path Warshall-Floyd algorithm 2. minimum spanning tree Kruskal avoidance meth