搜索资源列表
prim
- 最小生成树的pirm算法,用c++语言描述，如有疑问，欢迎咨询-Minimum spanning tree pirm algorithms using c++ language to describe, if in doubt, please consult
djkstl
- 最小生成树Prim算法和最短路Dijkstra算法◎联系与衍生-Prim minimum spanning tree algorithm and Dijkstra shortest path algorithm derived ◎ Contact
Prim
- 这是一个构造最小生成树的Prim算法，是属于贪心算法的范畴。设G=(V,E)是连同带权图，V={1，2，3，...，n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V = (1,2,3 ,..., n). G of the min
mst
- 最小生成树 MST的四种算法实现。 包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。 复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree Algorithm
prim
- prim算法构造最小生成树，调试通过，c++语言编写。-Minimum Spanning Tree Algorithm prim, debugging through, c++ languages.
PRIM
- 构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。-Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.
prim
- C语言实现普里姆算法 根据无向网构造最小生成树-C language implementation Prim algorithm based on minimum spanning tree in undirected network structure
prim
- C++，用PRIM算法求最小生成树，能输入顶点和边,计算最小生成树-C++, with the PRIM for the Minimum Spanning Tree, can enter the vertex and edge to calculate the minimum spanning tree
PRIM
- prim算法 ，输入一个图，然后 求它的最小生成树 -prim algorithm, input a graph, and then seek its minimum spanning tree
PrimKruscal
- Prim和Kruscal的最小生成树算法-Prim minimum spanning tree algorithm and Kruscal
Prim-algorithm
- 此代码用VC6.0开发，包含全部代码，内容为用prim算法实现最小生成树。-The VC6.0 development of this code contains all the code, the content of prim algorithm to achieve the minimum spanning tree.
prim
- 数据结构与算法的经典例题， 求最小生成树的算法之一， prim算法。-Data Structures and Algorithms classic example, find the minimum spanning tree algorithms, prim algorithm.
Prim
- 陈晓东 计算机算法与设计 最小生成树的Prim算法-Daniel and design of computer algorithms Prim minimum spanning tree algorithm
prim
- 求最小生成树的vc++工程,特别是在物流中心选择，铺设网络设施等领域，确定最佳连通关系，很有用-a vc++ project for a min generate tree
prim
- 利用Matlab编写构造最小生成树的Prim算法，程序注释清晰，通俗易懂。-Minimal Spanning Tree-- Prim
prim
- 利用C++编写最小生成树的Prim算法，程序思路很清晰，让人一目了然。-Minimal Spanning Tree
Prim
- 最小生成树prim算法的实现，代码结构清晰，适合初学者学习-The minimum spanning tree prim algorithm, code structure is clear, for beginners to learn
8.7-8.9 MattoList Prim Dijkstra
- 采用prim算法和kruskal算法求最小生成树 采用dijkstra算法求从顶点到其他顶点的最短路径和最短路径长度。(Using prim algorithm and Kruskal algorithm to find minimum spanning tree Dijkstra algorithm is used to find the shortest path and the shortest path length from vertex to other ver
最小生成树
- C++最小生成树算法，提供给算法爱好者学习，有图的基本概念，邻接矩阵，prim算法等(Minimum spanning tree algorithm)
最小生成树
- 最小生成树就是： 在所有数据满足是一棵树的情况下一条将所有节点都连接起来且长度最短的一条路（因为任意两个节点之间有权值 （相连的两点之间权值为一个具体的数，不相连的两个点之间权值为无穷大）） 下面介绍通用的求最小生成树的两种算法：(The smallest spanning tree is: When all data satisfy a tree, a path that connects all nodes is the shortest one, becau