搜索资源列表
DFS※Prim
- 用普里姆(Prim)算法构造最小生成树；图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non - recursive algorithm traversal function.
prim
- 算法分析与设计，基于随机生成的无向图的prim算法实现
最小生成树Prim算法
- 最小生成树Prim算法.rar 谢谢指教！~
Prim算法
- 用Prim算法求最小生成树-Prim used for the minimum spanning tree algorithm
prim
- prim算法的vc++实现，适合初学者好好学习，愿与朋友们一起进步
prim
- 实现最小生成树算法,通过PRIM算法实现.通过输入一串字符显示最小生成树.求得最小路径
用Prim算法求无向图的最小生成树
- 用Prim算法求无向图的最小生成树
prim算法，自己做的
- prim算法，自己做的
prim
- 数据结构课程设计，prim算法求最小生成树，给出了所有可能的生成树-Data structure course design, prim algorithm for minimum spanning tree, has given all the possible spanning tree
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
prim
- 求素数的源代码，用c语言写的，代码中算法要求较高-how to find the prim number
Prim
- 数据结构里的prim树的实现，有兴趣的朋友可以看看。-Data structure to achieve the prim tree, friends who are interested can look at.
prim
- prim算法构造最小生成树，调试通过，c++语言编写。-Minimum Spanning Tree Algorithm prim, debugging through, c++ languages.
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
- C语言实现普里姆算法 根据无向网构造最小生成树-C language implementation Prim algorithm based on minimum spanning tree in undirected network structure
prim
- 输入任意的一个网，用普里姆(Prim)算法构造最小生成树。-Enter any one network, with the prim (Prim) algorithm to construct minimum spanning tree.
最小生成树Prim算法
- Dandn文件给出了输入参数的名称及格式 即在调用prim前先输入邻接矩阵D和节点个数n 输入prim 得到两行的矩阵T,将上下两行数字对应的节点相连即可(The Dandn file gives the name and format of the input parameter That is, before entering prim, the adjacency matrix D and the number of nodes n are input Input prim G
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