搜索资源列表
prim
- 输入结点和各结点之间的距离，构造最小生成树并输出。-Input nodes and the distance between the nodes to construct the minimum spanning tree and output.
Prim
- 最小生成树的Prim算法的实现。这里是对无向图最小生成树的实现。-Prim minimum spanning tree algorithm. There is no realization of the minimum spanning tree graph.
prim
- 用prim算法实现最小生成树，运用c++代码实现最短路径问题-Minimum spanning tree algorithm with a prim, use c++ code to achieve the shortest path problem
prim
- 数据结构课程设计PRIM算法求最小生成树-don t konw
Graph-traversal-spanning-tree
- 1．显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量。 2．当用户选择的功能错误时，系统会输出相应的提示。 3．通过图操作的实现，把一些实际生活中的具体的事物抽象出来-Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree m
TREE_GA2
- 基于Matlab的用Prim算法求解最小生成树问题-Prim-based algorithm using Matlab' s minimum spanning tree problem
Prim
- 实现图的显示，最小生成树的动态演示，及最终显示-Achieve chart shows the minimum spanning tree dynamic presentation, and final display
Prim
- 这是个用vc实现的图中最小生成树的动态演示，适合学习VC++和数据结构的同志参考。-This is achieved with the vc dynamic minimum spanning tree graph shows, for learning VC++ and data structures comrades reference.
LJJZ
- 显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量-Shows the adjacency matrix, adjacency table, depth-first traversal, breadth-first traversal, minimum spanning tree PRIM algorithm, minimum spanning tree KRUSCAL algorithm, graph conn
final
- prim算法得出最小生成树，matlab语言-minimum spanning tree algorithm is derived prim, matlab language
Prims
- prim 最小生成树 代码 matlab平台使用-prim tree code matlab
prim
- 用prim算法实现最小生成树，要求输出为图形界面，实现入选，交换，调整等的功能-Minimum spanning tree algorithm with the prim, the output for the graphical interface required to achieve selected, exchange, adjustments and other features
prim
- 用普里姆算法从第u个顶点出发构造网G的最小生成树T,输出T的各条边-Primm algorithm with u vertices starting from the first network constructed minimum spanning tree of G T, the output of the edge T
Prim
- 最小生成树源代码,了解无向图最小生成树有用。-projective Maximum Spanning Tree.
prim
- /*分别利用prim算法和kruskal算法实现求图的最小生成树*/-/* Use, respectively, and kruskal prim algorithm graph algorithms find the minimum spanning tree* /
Prim
- 算法，写的prim算法，用的是贪心法，里面还有用到最小生成树来写的-Algorithm, written in the prim algorithm using a greedy method, there is also used to write the minimum spanning tree
tree_prim
- MATLAB最小生成树prim算法，将权数从小到大排序，按顺序添加，如果形成圈则去掉-MATLAB prim minimum spanning tree algorithm, the weights of small to large order, in order to add, if the ring is removed to form
liu
- 深度优先遍历 广度优先遍历 最小生成树PRIM算法 最小生成树KRUSCAL算法 -Breadth-first traversal depth-first traversal algorithm for minimum spanning tree minimum spanning tree KRUSCAL PRIM algorithm
prim
- 普利姆算法 运用普利姆算法求取最小生成树 c实现算法-Puli Mu Puli Mu algorithm using minimum spanning tree algorithm to strike
Prim
- 这是一个图论问题中最小生成树的一种构造算法。 按普里姆算法构造最小生成树的过程为：在所有“其一个顶点已经落在生成树上，而另一个顶点尚未落在生成树上”的边中取一条权值为最小的边，逐条加在生成树上，直至生成树中含有 n-1条边为止。 -This is a problem in graph theory, a minimum spanning tree construction algorithm. Primm constructed by the minimum spanning tree