Location:
Search - prim
Search list
Description: prim 最短路径实现 C++ 描述～代码规范，适合初学者-prim shortest path to achieve C++ description ~ code specifications, suitable for beginners
Platform: |
Size: 1024 |
Author: huochai |
Hits:
Description: prim算法 ，输入一个图，然后 求它的最小生成树 -prim algorithm, input a graph, and then seek its minimum spanning tree
Platform: |
Size: 1024 |
Author: 雅静 |
Hits:
Description: 基于最小生成树定理实现图最小生成树的prim算法-Implementation plan based on the theorem of minimum spanning tree minimum spanning tree algorithm prim
Platform: |
Size: 189440 |
Author: isabel dong |
Hits:
Description: 用prim算法求最小生成树，只要输入途中两点间权值，直接的结果-With prim for the Minimum Spanning Tree, as long as the power input on the way between two values, a direct result of
Platform: |
Size: 24576 |
Author: 洲际 |
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: C++实现prim算法求最小生成树，运用最小生成树理论可以解决很多实际问题-C++, prim for the Minimum Spanning Tree
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 数学计算 最小生成树-Prim算法-Math math-Prim minimum spanning tree algorithm
Platform: |
Size: 1024 |
Author: li |
Hits:
Description: 数据结构中的PRIM算法，在DEV c++测试通过，数据结构为邻接矩阵-The PRIM algorithm data structure, in DEV c++ test, the data structure of adjacency matrix
Platform: |
Size: 1024 |
Author: lizhenye |
Hits:
Description: 最小生成树的Prim算法的实现。这里是对无向图最小生成树的实现。-Prim minimum spanning tree algorithm. There is no realization of the minimum spanning tree graph.
Platform: |
Size: 1024 |
Author: lanboyj |
Hits:
Description: 用prim算法实现最小生成树，运用c++代码实现最短路径问题-Minimum spanning tree algorithm with a prim, use c++ code to achieve the shortest path problem
Platform: |
Size: 891904 |
Author: yk |
Hits:
Description: 数据结构课程设计PRIM算法求最小生成树-don t konw
Platform: |
Size: 320512 |
Author: jdiids |
Hits:
Description: 实现了数据结构中的Prim算法，输入初始值能得到Prim图-Data structure to achieve the Prim algorithm, enter the initial value can be Prim map
Platform: |
Size: 176128 |
Author: 胡容 |
Hits:
Description: prim算法，明了，简单，变量命名规范，适合初学者。-prim algorithm, clear, simple, variable naming conventions, for beginners.
Platform: |
Size: 1024 |
Author: 千销毁 |
Hits:
Description: 基于Matlab的用Prim算法求解最小生成树问题-Prim-based algorithm using Matlab' s minimum spanning tree problem
Platform: |
Size: 2048 |
Author: Messi |
Hits:
Description: 本程序实现最短路径中的一个算法，prim算法、。-The program realization of a shortest path algorithm, prim algorithm.
Platform: |
Size: 1024 |
Author: |
Hits:
Description: prim算法得出最小生成树，matlab语言-minimum spanning tree algorithm is derived prim, matlab language
Platform: |
Size: 332800 |
Author: 曾玉洁 |
Hits:
Description: 图论算法。图论算法在计算机科学中扮演着很重要的角色，它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题，然后用图论的基本算法加以解决。本资料包含了Floyd、prim、匈牙利算法等算法-Graph algorithms. Graph algorithms in computer science plays a very important role, it provides a lot of problems for a simple and effective way of modeling the system. Many problems can be transformed into graph theory problems, and then use the basic algorithm of graph theory to solve them. This information includes Floyd, prim, the Hungarian algorithm algorithm
Platform: |
Size: 37888 |
Author: 秦莉平 |
Hits:
Description: 描述tree的運用，並且利用Prim s來解決次問題-Describe the use of tree and use Prim' s to solve the time problem
Platform: |
Size: 2048 |
Author: Lkk |
Hits:
Description: Prim algorithm in C-Prim algorithm in C++
Platform: |
Size: 1024 |
Author: kaveh |
Hits:
Description: 数据结构中的PRIM算法，自己编写的，仅供参考-The PRIM algorithm data structure, their preparation, for reference only. . . . .
Platform: |
Size: 1095680 |
Author: fasfas |
Hits:
«
1
2
...
4
5
6
7
8
910
11
12
13
14
...
33
»