Description: 最小生成树：利用普鲁姆算法，完成将给定节点和边的权值的图生成最小生成树，用于各项公共事业最少经费的设计方法-minimum spanning tree : pass algorithm, Givens completed nodes and the right side of the value of the minimum spanning tree generation for public utilities at least for the design method Platform: |
Size: 1656 |
Author:杨翠 |
Hits:
Description: 最小生成树：利用普鲁姆算法，完成将给定节点和边的权值的图生成最小生成树，用于各项公共事业最少经费的设计方法-minimum spanning tree : pass algorithm, Givens completed nodes and the right side of the value of the minimum spanning tree generation for public utilities at least for the design method Platform: |
Size: 1024 |
Author:杨翠 |
Hits:
Description: <经典算法合集>其中包括:
最小生成树
MD5加密
LZW压缩
josephus
乘法表
积分
枚举
基数转换
矩阵问题举例
求解质数
圆周率的求法
改进的快速排序法
几种插入排序法
水仙花数
迷宫生成器
生命游戏
递归
回溯
贪心
动态规划
排序算法-" Classical algorithm Collection> These include: minimum spanning tree MD5 encryption LZW compression josephus multiplication table base transformation matrix integral enumeration problem solving prime number example, the rate of Improved Methods of the circumference of the Quick Sort Insertion Sort Narcissistic number of several maze generator recursive Game of Life dynamic programming backtracking greedy sorting algorithm Platform: |
Size: 4215808 |
Author:我很笨 |
Hits:
Description: Prime算法生成最小生成树，使用GDI+将最小生成树画出-Prime algorithm to generate minimum spanning tree, minimum spanning tree to use GDI+ to draw Platform: |
Size: 2468864 |
Author:姚明 |
Hits:
Description: 图论的最小生成树问题——Prime算法的C语言实现-Graph theory, minimum spanning tree problem- Prime algorithm in C language Platform: |
Size: 1024 |
Author:chen |
Hits:
Description: 最小生成树算法，prime算法，绝对能运行-Minimum spanning tree algorithm, prime algorithm can certainly run Platform: |
Size: 1024 |
Author:youlanlan |
Hits:
Description: prime 算法是一个最小生成树的算法 内含例题是一个很好的教学材料-The prime algorithm contains examples of a minimum spanning tree algorithm is a good teaching material Platform: |
Size: 1024 |
Author:li |
Hits:
Description: prime算法,关于求最小生成树的，注释十分清楚。-prime algorithm, is very clear on the minimum spanning tree, comments Platform: |
Size: 1024 |
Author:Blackie |
Hits:
Description: prime算法的基本思想
1.清空生成树，任取一个顶点加入生成树
2.在那些一个端点在生成树里，另一个端点不在生成树里的边中，选取一条权最小的边，将它和另一个端点加进生成树
3.重复步骤2，直到所有的顶点都进入了生成树为止，此时的生成树就是最小生成树-The basic idea of the prime algorithm. Empty spanning tree, take any a vertex joined spanning tree. those endpoints in the spanning tree, another edge endpoint is not in the spanning tree, select a right to the smallest edge to it and other endpoint added Spanning Tree 3 Repeat step 2 until all vertices are entered until the spanning tree, spanning tree at this time is the minimum spanning tree Platform: |
Size: 1024 |
Author:liming |
Hits:
Description: 联通图G的一个子图如果是一棵包含G的所有顶点的树，则该子图称为G的生成树 生成树是联通图的极小连通子图。所谓极小是指：若在树中任意增加一条边，则 将出现一个回路；若去掉一条边，将会使之编程非连通图。生成树各边的权 值总和称为生成素的权。权最小的生成树称为最小生成树，常用的算法有prime算法和kruskal算法。
-Unicom graph G is a subgraph of G is the one that contains all the vertices of the tree, the subgraph Spanning Tree Spanning Tree called G Unicom Figure minimal connected subgraph. The so-called minimal means: any tree, add an edge, then a loop an edge if removed, will make the programming of non-connected graph. The sum of the weights of each edge of the spanning tree is called the right of erythropoietin. The right to the minimum spanning tree called the minimum spanning tree, commonly used algorithms prime algorithm and kruskal-algorithms. Platform: |
Size: 1024 |
Author:liming |
Hits:
Description: 各种算法模板（二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、）-Various algorithms template (bipartite graph matching Hungarian algorithm, the minimum spanning tree the prime and kruskal algorithm, Dijkstra algorithm, two shortest path negative weight value side SPFA algorithm, Fig any two points on the shortest path Floy algorithms, network flow SAP algorithms, network maximum flow minimum cost algorithm multiplicative inverse gcd expansion algorithm, segment tree interval division statistical algorithms, the matrix of the n-th power of divide and conquer to solve the gcd algorithm, integer division problem, the minimum point of the function, decimal turn ACM algorithm, primes screening method solving and Euler function, fast mode algorithm, the string matching KMP algorithm, a dictionary full array algorithm, fast row, the sort of three dimensional) Platform: |
Size: 18432 |
Author:林云 |
Hits:
Description: 可以用prim算法来生成最小生成树，对于数据结构的学习者有一定参考意义-Prim algorithm can be used to generate the minimum spanning tree data structure for learners are meaningful Platform: |
Size: 1024 |
Author:文静 |
Hits:
Description: 用C++实现prime算法，实现最小生成树，代码简单-With C++ achieve prime algorithm, and the minimum spanning tree, the code is simple Platform: |
Size: 187392 |
Author:戴涛 |
Hits:
Description: 根据普利姆算法计算最小生成树，并在最后给出最小生成树的路径值-Value based plym minimum spanning tree algorithm, and finally gives the minimum spanning tree path Platform: |
Size: 1024 |
Author:tianmiaomiao |
Hits:
Description: java cod for implementing Prime algorithm for creating minimum spanning tree for weighted graph Platform: |
Size: 3072 |
Author:nasser |
Hits:
Description: This a Prime Minimum Spanning Tree Programme! It is very good for user in coding programming! Platform: |
Size: 8192 |
Author:zia66ugan3 |
Hits:
Search - prime minimum spanning tree