Location:
Search - mst prim
Search list
Description: 最小生成树，使用PRIM方法生成最小生成树。-Minimum Spanning Tree, use the PRIM method to generate minimum spanning tree.
Platform: |
Size: 1024 |
Author: luke |
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算法-Minimum Spanning Tree Algorithms of implementation, including the Kruskal and Prim algorithms
Platform: |
Size: 3072 |
Author: 诗苇 |
Hits:
Description: 对于网络，其生成树中的边也带权，将生成树各边的权值总和称为生成树的权，并将权值最小的生成树称为最小生成树（Minimun Spanning Tree），简称为MST。
Prim算法的基本思想是：
(1) 在图G=(V, E) （V表示顶点 ，E表示边）中，从集合V中任取一个顶点（例如取顶点v0）放入集合 U中，这时 U={v0}，集合T(E)为空。
(2) 从v0出发寻找与U中顶点相邻（另一顶点在V中）权值最小的边的另一顶点v1，并使v1加入U。即U={v0,v1 }，同时将该边加入集合T(E)中。
(3) 重复(2)，直到U = V为止。
-prim
Platform: |
Size: 177152 |
Author: zc |
Hits:
Description: Minimum Spanning Tree implementation using kruskal and prims algorithm.
Platform: |
Size: 2048 |
Author: shi |
Hits:
Description: Prim`s and Kruskal`s Alghoritm, finding mst
Platform: |
Size: 1020928 |
Author: expert2000 |
Hits:
Description: 实现最小生成树的算法（包括Kruskal和Prim算法） 在codeblocks下运行-Achieve the minimum spanning tree algorithm
Platform: |
Size: 139264 |
Author: 田飞 |
Hits:
Description: 一些ACM题源码,包括部分北大poj上的题目和《新编常用算法及程序题解》里面算法的程序实现-some code of ACM problems
Platform: |
Size: 69632 |
Author: kaka |
Hits:
Description: 用prim算法求带权图的最小生成树，最小生成树的边集合存在mst数组中-With prim algorithm for getting the right plan with the minimum spanning tree, minimum spanning tree of the edge set of the array there mst
Platform: |
Size: 250880 |
Author: 刘月 |
Hits:
Description: 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
Platform: |
Size: 3072 |
Author: lkq |
Hits:
Description: 算法特点：该算法的特点是当前形成的集合T始终是一棵树。将T中U和TE分别看作红点和红边集，V-U看作蓝点集。算法的每一步均是在连接红、蓝点集的紫边中选择一条轻边扩充进T中。MST性质保证了此边是安全的。T从任意的根r开始，并逐渐生长直至U=V，即T包含了 C中所有的顶点为止。MST性质确保此时的T是G的一棵MST。因为每次添加的边是使树中的权尽可能小，因此这是一种"贪心"的策略。
-Algorithm characteristics: the algorithm is characterized by the formation of the current set of T is always a tree. The T, U and TE were seen as red dots and red edge set, VU as a blue dot set. Every step of the algorithm are connecting the red, blue, choose a set of purple fringing to expand into the T in the light side. The nature side of MST to ensure that this is safe. T starting from any root r, and gradually grow up to U = V, ie T contains all the vertices of C so far. MST to ensure that this time the nature of the tree T is a G MST. Because each side is to add the right tree as small as possible, so this is a " greedy" strategy.
Platform: |
Size: 1024 |
Author: 吕济根 |
Hits:
Description: A C++ Program to implement the Prim s Algorithm to solve Minimum Spanning Tree Problem (MST).
Platform: |
Size: 2048 |
Author: akanmanu |
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算法matlab实现，计算出总权值和最优连线。-Minimum spanning tree algorithm matlab prim implemented to calculate the total weight and the optimal connection.
Platform: |
Size: 1024 |
Author: 南达 |
Hits:
Description: 这是算法设计与分析课程实验， 贪心算法实验的简单的源代码，包括汽车加油，多级调度问题 ，prim最小生成树-This is the algorithm design and analysis course experiment, the experiment simple greedy algorithm source code, including vehicle refueling, multi-level scheduling problem, prim MST
Platform: |
Size: 2048 |
Author: 林达 |
Hits:
Description: 实现自建无向图，生成多生成树，MFC图形界面 c-To achieve self undirected graph, generate multi-spanning tree, MFC graphical interface to C++
Platform: |
Size: 14765056 |
Author: zhang |
Hits:
Description: A Prim s variation for use on Wireless Sensor Networks. We choose as next node to add to the MST, the node with max. residual energy.
Platform: |
Size: 3072 |
Author: _Jimmy |
Hits:
Description: CS2208 - Data Structures Lab (Anna University)
EXERCISES
1a. Implement singly linked lists.
1b. Implement doubly linked lists.
2. Represent a polynomial as a linked list and write functions for polynomial addition.
3. Implement stack and use it to convert infix to postfix expression
4. Implement a double-ended queue (dequeue) where insertion and deletion operations are possible at both the ends.
5. Implement an expression tree. Produce its pre-order, in-order, and postorder traversals.
6. Implement binary search tree.
7. Implement insertion in AVL trees.
8. Implement priority queue using binary heaps
9. Implement hashing with open addressing.
10. Implement Prim s algorithm using priority queues to find MST of an undirected graph.
Platform: |
Size: 209920 |
Author: Narayana Swamy |
Hits:
Description: 最小生成树的prim算法.可导入多种文件计算-Minimum spanning tree algorithm prim. You can import a variety of files on your computer
Platform: |
Size: 1024 |
Author: husong |
Hits: