Description: 这是我用net写的一个prim算法计算最小生成树的程序，欢迎大家下载-with net write a prim minimum spanning tree algorithm for the calculation procedures, we are happy to download Platform: |
Size: 95161 |
Author:king |
Hits:
Description: Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes! Platform: |
Size: 1024 |
Author:gao |
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: prim算法 是一个比较常见的求最小生成树的算法,它用贪婪准则来编写算法的!-prim algorithm is a more common for the minimum spanning tree algorithm, which used to prepare guidelines for the greedy algorithm! Platform: |
Size: 1024 |
Author:louy |
Hits:
Description: 用普里姆(Prim)算法构造最小生成树,满分作业，运行无错的-With prim (Prim) Minimum Spanning Tree Algorithm, out of operation, run no wrong Platform: |
Size: 163840 |
Author:海瑞 |
Hits:
Description: 自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。-Own, and in VB in the minimum spanning tree algorithm prim implementation code, there is graph, edge weights are randomly generated, five nodes, point " generate tree" , will show the most trees. Platform: |
Size: 2048 |
Author: |
Hits:
Description: 最小生成树Prim算法的matlab文件，无论是在数据结构还是在图论中都有广泛的应用-Prim minimum spanning tree algorithm matlab file, whether in data structures or graph theory, there are a wide range of applications Platform: |
Size: 1024 |
Author:小明 |
Hits:
Description: matlab实现的最小生成树的两种最基本的算法即Kruskal，Prim。-matlab realization of the minimum spanning tree algorithm that is, the two most basic Kruskal, Prim. Platform: |
Size: 1024 |
Author:michael wang |
Hits:
Description: Kruskal算法和Prim算法
任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通).
加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和.
最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm
Any edge of only by G, is composed of all the vertices containing G tree called G of the spanning tree (G connected).
The weighted no directed graph G is the price of spanning tree all the spanning tree right on the edge of the code () and.
The lowest cost spanning tree is in all its spanning tree minimum cost of the spanning tree. Platform: |
Size: 1024 |
Author:江洋 |
Hits:
Description: 最小生成树Prim算法。Dandn文件给出了输入参数的名称及格式即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可。-Prim minimum spanning tree algorithm. The file of Dandn up and down two rows of numbers corresponding node connected to the name and format of the input parameters that prim is called before the first two rows of the matrix T n input prim input adjacency matrix D and the number of nodes. Platform: |
Size: 1024 |
Author:韩松 |
Hits:
Search - prim-minimum-spanning-tree-algorithm