搜索资源列表
prim
- prim算法构造最小生成树，调试通过，c++语言编写。-Minimum Spanning Tree Algorithm prim, debugging through, c++ languages.
prim
- 普里姆算法，求图的最小生成树问题。用的是C语言，比书上的详细。-Prim algorithm, and the minimum spanning tree problem Fig. Using the C language, the detailed than the book.
shortestpath
- 这个算法通过matlab仿真得到的最小生成树Prim算法-Matlab simulation of the algorithm obtained Prim minimum spanning tree algorithm
mintreePrim
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n 输入prim 得到两行的矩阵T,将上下两行数字对应的节点相连即可-Dandn document gives the name of the input parameters and format Prim in the call prior to the importation of adjacency matrix D and the node number n Input pri
prim
- 对于网络，其生成树中的边也带权，将生成树各边的权值总和称为生成树的权，并将权值最小的生成树称为最小生成树（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 }
GraphTheory
- 自己写的图论的一些基本算法，有找关键路径，最短生成树，Prim算法-On their own plans to write some of the basic algorithm, there is to find the critical path, minimum spanning tree, Prim algorithm, etc.
Prim
- prim算法是常用的一种解决最小生成树问题的算法-There are three reasons for the changes that have taken place in our life.Firstly，people s living standard has been greatly improved.Secondly，most people are well paid， and they can afford what they need or like.Last but not
Prim-Kruskal-Dijkstra
- 数据结构课程设计据结构课程设计范例\Prim-Kruskal-Dijkstra.rar-Data structure, according to the structure of curriculum design curriculum design examples \ Prim-Kruskal-Dijkstra.rar
prim
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the
prim
- Find the sum of the edges of the minimum spanning tree of a graph using the Prim s algortithm.
prim
- prim求最小生成树，求最短路径，并求出权值-prim for minimum spanning tree, and the shortest path and find the right value
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
- Prim算法（节点可任意选定） Prim算法（节点可任意选定）-prim algorithm
Prims_Algorithm
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the
PRIM
- prim s algorithm implementation in C++ with graphical output
prim
- 依据prim最小生成树的算法实现的最小生成树源码，能够建立准确的最小代价生成树-Prim minimum spanning tree based on the minimum spanning tree algorithm source code, be able to establish an accurate minimum cost spanning tree
prim
- Prim算法用于求无向图的最小生成树. -Prim algorithm is used to seek an undirected graph of the minimum spanning tree
spanning_tree
- 最小生成树的多种形式。Kruskal邻接表，正向表，prim+binary_heap邻接表正向表，prim+mapped_heap邻接表正向表.-Minimum spanning tree in many forms. Kruskal adjacency list, forward the table, prim+ binary_heap forward adjacency list table, prim+ mapped_heap forward adjacency list table.
Prim
- 应用Prim算法构造最小生成树，是数据结构的节本算法-Application of Prim minimum spanning tree algorithm is constructed, the data section of the structure of the algorithm
prim
- Prim’s Minimum Spanning Tree Algorithm