搜索资源列表
kruskal
- K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选取的边若产生环路则不可能形成一棵生成树-K ruskal algorithm each time you select n-1 edges, using criteria of greed: from the left side, select a loop with no minimum spend has been selected to
kruskal
- 计算最小生成树的kruskal算法，最普通未加任何优化的最小生成树算法！利于新手理解-Algorithm for computing minimum spanning tree kruskal, the most common Without any optimization of the minimum spanning tree algorithm! Help novice to understand
KRUSKAL
- Kruskal algorithm used for graph algorithms
KRUSKAL
- 建立邻接矩阵和邻接表，用克鲁斯卡尔算法求最小生成树-KRUSKAL function
Kruskal
- VC++代码实现连通图最小生成树的Kruskal算法-VC++ code connected graph Kruskal minimum spanning tree algorithm
Kruskal
- 用kruskal算法找最接近点对并分组。如我给出的测试数据，给定2000个多点，将最接近的点放在一个组里，最后分成九个组。程序可直接运行。-Algorithm used to find the closest point kruskal and groups. If I give the test data given over 2000 points, the closest point in a group, and finally divided into nine groups. Pro
kruskal
- graph kruskal algoritm
Kruskal
- Kruskal Algorithm C implementation
kruskal
- 使用KRUSKAL算法求取最小代价生成树-Use KRUSKAL algorithm to strike a minimum cost spanning tree
kruskal
- algoritm of kruskal one of the most important algoritm of search
Kruskal
- Kruskal s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in
Graph-theory-Kruskal-minimum-spanning-tree-algori
- Graph theory Kruskal minimum spanning tree algorithm and Paint program
kruskal
- 最优化代码的并查集优化的kruskal代码-it is about kruskal,but it is very simple and easy to use!
kruskal
- 克鲁斯卡尔算法通常用来求解最小生成树问题，使树的权值之和最小。-Kruskal algorithm is usually used to solve the minimum spanning tree problem, so the right value of the tree and the minimum.
Kruskal
- 本程序使用VS2008环境编写，主要功能是实现Kruskal算法-This program uses written in VS2008 environment, the main function is to achieve the Kruskal algorithm
Kruskal
- 贪心法是解决某些优化问题的一种策略。假设我们可以通过一系列的决策来解决某个问题。贪心法使用如下的方法：在每个阶段做出的决策都是局部最优的决策。对于某些问题，这些局部最优解最终成为全局最优解。-Generation of minimum spanning tree algorithm Kruskal
Kruskal-algorithm
- 利用Kruskal算法，求各城市之间的最佳通信线路的布置问题。-Kruskal algorithm, to seeking the best lines of communication between cities layout.
kruskal
- kruskal的一个通用算法的例程，非常有利于最短路径相关的学习-kruskal the routine of a generic algorithm, is very conducive to the learning of the shortest path
kruskal
- 求最短路径的kruskal程序源代码适用于最小生成树-The shortest path kruskal source code
Kruskal
- KRUSKAL算法 主要实现寻找最小生成树的功能-kruskal algorithm