Location:
Search - prim heap
Search list
Description: 图的操作，最小生成树的原代码！（用pirm做的哦！）- Chart operation, smallest production tree s original code!
(Does with pirm oh!)
Platform: |
Size: 1024 |
Author: 王猛 |
Hits:
Description: 算法设计的实验报告
包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Report including Bottom-Up Merge Sorting Algorithm, Insertion Sort algorithm creation Heaps Heap, Heap Sort algorithm, according to rank and merge algorithm with path compression algorithm to find the first small element K algorithm, the realization of quick sort algorithm, the realization of planar within the nearest point on the algorithm to achieve the longest common sub-sequence algorithm, the realization of matrix-chain multiplication algorithm, the realization of 0/1 knapsack problem algorithm Dijistra s algorithm, Prim algorithm, Kruskal algorithm, file compression algorithm
Platform: |
Size: 28672 |
Author: 苏宁 |
Hits:
Description: 最小生成树 MST的四种算法实现。
包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。
复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree
Algorithm
Platform: |
Size: 3918848 |
Author: 黄劲松 |
Hits:
Description: prim算法是将一个无向图生成最小生成树的算法。其中一个是用最下堆实现的，已在压缩包的txt文件中说明。-prim algorithm is an undirected graph generated minimum spanning tree algorithms. One of them is the most under the heap to achieve, has been compressed package txt-documented.
Platform: |
Size: 8192 |
Author: liuhua |
Hits:
Description: 最小生成树之Prim算法 Prim算法用于求无向图的最小生成树
设图G =（V，E），其生成树的顶点集合为U。
①、把v0放入U。
②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。
③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。
其算法的时间复杂度为O(n^2)
Prim算法实现：
（1）集合：设置一个数组set(i=0,1,..,n-1),初始值为 0,代表对应顶点不在集合中（注意：顶点号与下标号差1）
（2）图用邻接阵表示，路径不通用无穷大表示，在计算机中可用一个大整数代替。
采用堆可以将复杂度降为O(m log n)，如果采用Fibonaci堆可以将复杂度降为O(n log n + m)-Prim minimum spanning tree algorithm of Prim algorithm for the undirected minimum spanning tree graph
Set graph G = (V, E), the spanning tree of the vertex set of the U.
①, the v0 into U.
②, all u ∈ U, v ∈ VU edge (u, v) ∈ E, find a minimum weight edge, join the spanning tree.
③, ② to find the edge to join the U v collection. If the set has n elements U, then the end, or continue to ②.
The algorithm s time complexity is O (n ^ 2)
Prim algorithm:
(1) set: Set an array of set (i = 0,1, .., n-1), the initial value is 0, the corresponding vertex is not in the collection (Note: vertex under the label with the No. 1 bad)
(2) map with the adjacency matrix that is not universal infinite path that is available in the computer instead of a large integer.
Complexity of using the heap can be reduced to O (m log n), if the heap can be used Fibonaci reduced complexity O (n log n+ m)
Platform: |
Size: 1024 |
Author: 杨博文 |
Hits:
Description: 数据结构基本算法演示程序实现：
1、实现KMP模式匹配算法、哈夫曼编码算法、由遍历序列恢复二叉树、Prim算法、Kruskal算法、Floyd算法、Dijkstra算法、拓扑排序、关键路径算法、二叉排序树生成算法（含平衡化）、哈希表生成及哈希查找算法、希尔排序、快速排序、堆排序、归并排序、基数排序。（四则表达式计算、矩阵运算、有向图的强连通分量求解）
2、算法中的链表结构和数组结构的基本操作要求单独函数实现（同组内算法要求共享使用）。
要求数据结构基本算法演示程序具有菜单选择，算法要有结果的显示形式，显示程序框架
-Basic algorithm demo program data structures to achieve:
1, and KMP pattern matching algorithm, Huffman coding algorithm, the binary tree traversal sequence recovery, Prim algorithm, Kruskal algorithm, Floyd algorithm, Dijkstra algorithm, topological sorting, critical path algorithm, binary sort tree generation algorithm (including the balance of), hash table hash search algorithm generates and Hill sort, quick sort, heap sort, merge sort, radix sort. (D expression computing, matrix operations, have to solve the graph strongly connected components)
2, the algorithm in the list structure and basic operation of the array structure requires a separate function to achieve (within the algorithm requires the same set of shared use.)
Basic algorithm required data structure has the menu to select the demonstration program, the algorithm should have the results display format, display program framework
Platform: |
Size: 20480 |
Author: dark |
Hits:
Description: 最小生成树算法代码，采用堆的知识，并用prim算法来实现。-Minimum spanning tree algorithm code, using of the heap , and with the prim algorithm to achieve.
Platform: |
Size: 1024 |
Author: 田田 |
Hits:
Description: 编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。
（其中随机生成点和边，形成连通图）
根据输入的顶点数的不同，分析时间复杂度。-Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points ( ) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
Platform: |
Size: 2048 |
Author: 许许 |
Hits:
Description: 数据结构的课程设计，要求用堆排序实现prim算法的最小边的权值选择，改的程序，调试了，可以运行-Data structure curriculum design requirements heap sort prim algorithm of minimum weight edge select change program, debug, you can run
Platform: |
Size: 1024 |
Author: 宋恒军 |
Hits: