Location:
Search - kruskal
Search list
Description: kruskal algo is an efficient searching algo
Platform: |
Size: 1024 |
Author: maxpayne558 |
Hits:
Description: kruskal algo is a sorting algo
Platform: |
Size: 1024 |
Author: aditya |
Hits:
Description: 最小生成树 kruskal算法， 联通图，最短路径-Kruskal minimum spanning tree algorithm, Unicom map, the shortest path
Platform: |
Size: 3072 |
Author: dyh |
Hits:
Description: Kruskal s algorythm. Working code!
Platform: |
Size: 2048 |
Author: Joze Ruzic |
Hits:
Description: 克鲁斯卡尔算法思想.cpp
int seekedge(EDGE * (&a), int n)
void bubble(EDGE * (&a), int size)
void searchandjoin(EDGE * (&a1), int k) // a1是图边集头指针，a2是最小生成树边集的头指针，k为所要删的边
void storepicture(EDGE * (&a), int n, VERTEX *b, int m) -Thinking of Kruskal algorithm. Cpp int seekedge (EDGE* (& a), int n) void bubble (EDGE* (& a), int size) void searchandjoin (EDGE* (& a1), int k) // a1 edge set is the first pointer map, a2 is the minimum spanning tree of the first indicators margination, k for the edges to be deleted void storepicture (EDGE* (& a), int n, VERTEX* b, int m)
Platform: |
Size: 24576 |
Author: 李虚东 |
Hits:
Description: 本文件是数据结构中很重要的一个图的Kruskal算法。Kruskal算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。将文件编译，可完成Kruskal算法-This document is a very important data structure of a graph algorithm of Kruskal. Kruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left side will not have to select a loop with the smallest cost of the edge of the edge has been selected to join the collection. Documents compiled, to be completed by Kruskal Algorithm
Platform: |
Size: 4096 |
Author: 吉铭 |
Hits:
Description: Minimum Spanning Tree implementation using kruskal and prims algorithm.
Platform: |
Size: 2048 |
Author: shi |
Hits:
Description: 以文本形式输出生成树中各条边以及他们的权值
Platform: |
Size: 405504 |
Author: zhuxien |
Hits:
Description: 克瑞斯卡尔算法，是关于克瑞斯卡尔算法的代码，详细介绍了有关克瑞斯卡尔算法的实现。-kruskal algorithm,kruskal algorithm on the code, setting out in detail the algorithm kruskal。
Platform: |
Size: 1024 |
Author: 周大 |
Hits:
Description: lcs ,prims ,kruskal ,merge algorithms for ada -lcs ,prims ,kruskal ,merge algorithms for ada
Platform: |
Size: 5120 |
Author: saurabhsingh |
Hits:
Description: MATLAB 图论中经常涉及的球最小生成树的prim和kruskal算法-prim+and+kruskal
Platform: |
Size: 337920 |
Author: cherry |
Hits:
Description: 最小生成树的matlab程序，运行并检验过，运行成功，可以应用。-Minimum Spanning Tree matlab procedures, and test run, and run successfully, can be applied.
Platform: |
Size: 1024 |
Author: 齐齐 |
Hits:
Description: kruskal 算法程序 解决最短路径问题 -kruskal shortest path algorithm to solve the issue of procedures
Platform: |
Size: 1024 |
Author: daiqiang5566 |
Hits:
Description: 构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。-Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.
Platform: |
Size: 1024 |
Author: workfuture |
Hits:
Description: 利用克鲁斯卡尔算法求边集数组GE所示图的最小生成树-Order to Kruskal algorithm using an array of GE edge set of minimum spanning tree as shown in Figure
Platform: |
Size: 1024 |
Author: 朱波涛 |
Hits:
Description: kruskal算法_POJ 1258代码-kruskal algorithm _POJ 1258 code
Platform: |
Size: 2048 |
Author: Frank |
Hits:
Description: 数据结构中实现最小生成树的kruskal算法的C语言源代码-Data structure to achieve the minimum spanning tree kruskal algorithm C-language source code
Platform: |
Size: 11264 |
Author: maxiujuan |
Hits:
Description: Kruskal s algorithm implementation for graphs
Platform: |
Size: 1024 |
Author: abcdefglksl |
Hits:
Description: 最小生成树的多种形式。Kruskal邻接表，正向表，prim+binary_heap邻接表正向表，prim+mapped_heap邻接表正向表.-Minimum spanning tree in many forms. Kruskal adjacency list, forward the table, prim+ binary_heap forward adjacency list table, prim+ mapped_heap forward adjacency list table.
Platform: |
Size: 7168 |
Author: 王华 |
Hits:
Description: it is a code for kruskal algorithm
Platform: |
Size: 1024 |
Author: Dilpreet |
Hits:
«
1
2
3
4
5
6
78
9
10
11
12
...
28
»