搜索资源列表
Kruskal
- ALGORITHM KRUSKAL s with computational comlexity for 5 to 30 tops. with chart.
Heap
- 以模板的方式实现小顶堆，算法节省空间和时间。-implement small-top heap. the algorithm needs lest time and space.
Cpp1
- 已知一以动态存储结构形式存储的，以邻接多重表表示的无向图。请用KRUSKAL算法求出它的最小代价生成树。-Storage structure known to form a dynamic storage to multiple tables that non-adjacent to the graph. Please KRUSKAL algorithm solves the minimum cost spanning tree.
primkruskal
- 用克鲁斯卡尔（kruskal)算法求N个结点所联成的加权无向图的最小生成树，核心代码比较简单。-Using Kruskal (kruskal) algorithm to solve the N nodes are linked to form a weighted undirected graph of the minimum spanning tree, the core code simple.
03072003zuixiaoshengchengshu
- 数据结构作业，克鲁斯卡尔算法求最小生成树。-Data structure operations, Kruskal algorithm to solve the minimum spanning tree.
daima
- c语言数据结构，bitree bubble graph Kruskal算法等等 10余种数据结构与排序算法-c language data structure, bitree bubble graph Kruskal algorithm and so on more than 10 kinds of data structures and sorting algorithms
MST
- Two algorithm template(Kruskal Algorithm and Prim Algorithm) to help you get a Minimum Spanning Tr-Two algorithm template(Kruskal Algorithm and Prim Algorithm) to help you get a Minimum Spanning Tree
suanfa
- 数据结构基本算法演示程序实现： 1、实现KMP模式匹配算法、哈夫曼编码算法、由遍历序列恢复二叉树、Prim算法、Kruskal算法、Floyd算法、Dijkstra算法、拓扑排序、关键路径算法、二叉排序树生成算法（含平衡化）、哈希表生成及哈希查找算法、希尔排序、快速排序、堆排序、归并排序、基数排序。（四则表达式计算、矩阵运算、有向图的强连通分量求解） 2、算法中的链表结构和数组结构的基本操作要求单独函数实现（同组内算法要求共享使用）。 要求数据结构基本算法演示程序具有菜单选择，算法要
least-tree
- 基于Kruskal算法的求最小生成树的源代码-Kruskal algorithm based on the source code for the Minimum Spanning Tree
-AGM-Kruskal
- This algorithm find the shortest patch using the Kruskall algortithm, coded in C language
Kruskal
- 编程实现Kruskal算法，生成最小代价生成树，其中利用最小堆算法实现。 （随机生成n个点，且随机生成k条边，形成连通图） 根据输入的顶点数的不同，分析时间复杂度。-Implement Kruskal’s algorithm based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected com
MST_Kruskal
- 克鲁斯卡尔算法，属于图论解决最短路径的叫优化的算法。-Kruskal algorithm, graph theory to solve the shortest path is called optimization algorithms.
kruskal_matlab
- 使用matlab实现Kruskal算法，用于产生最小生成树，包括测试结果-use matlab to realize Kruskal algorithm， Minimum Spanning Tree,including test result
kruskal
- matlab中实现最小生成树的kruskal算法-matlab kruskal to achieve the minimum spanning tree algorithm
kruskal
- 图论中用于搜索最小生成树和最短路径的Kruskal算法-Graph theory to search for the minimum spanning tree and shortest path algorithm of Kruskal
CPP_map
- 图的基本结构，及基本操作，包括最短路径树，最小生成树的Prim算法和克鲁斯卡尔算法-Map the basic structure and basic operations, including the shortest path tree, Prim' s minimum spanning tree algorithm and Kruskal algorithm
shortest
- 最小代价生成树，克鲁斯卡尔算法，最短路径-Minimum cost spanning tree, Kruskal algorithm
Greedy-algorithm
- greedy algorithm:Applications-Kruskal, Prim , Dijkstra, Backpack
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
minimum-spanning-tree
- 本程序用Kruskal算法构造最小生成树，注释详细并附带调试结果-Creating a minimum spanning tree with the Kruskal algorithm.