搜索资源列表
-
0下载:
最大流量Prim 算法寻找最小生成树,用C语言实现,有完整的注释-maximum flow Prim finding minimum spanning tree algorithm, using C language, a complete Notes
-
-
0下载:
本程序是一个用prim算法寻找最小生成树的小程序。-this procedure is a prim with minimum spanning tree algorithm for small procedures.
-
-
0下载:
用普里姆(Prim)算法求用邻接矩阵存储结构表示的图或网的最小生成树,With the prim algorithm is seeking to use adjacency matrix storage structure, said the plan or network, minimum spanning tree
-
-
0下载:
用prim算法实现最小生成树,运用c++代码实现最短路径问题-Minimum spanning tree algorithm with a prim, use c++ code to achieve the shortest path problem
-
-
0下载:
最小生成树的Prim 和Kruscal算法-Prim minimum spanning tree algorithm and Kruscal
-
-
0下载:
1.显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量。
2.当用户选择的功能错误时,系统会输出相应的提示。
3.通过图操作的实现,把一些实际生活中的具体的事物抽象出来-Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree m
-
-
0下载:
prim算法得出最小生成树,matlab语言-minimum spanning tree algorithm is derived prim, matlab language
-
-
0下载:
用prim算法计算最小生成树的总权值和最优连线。-Prim minimum spanning tree algorithm with the total group and the best connection.
-
-
0下载:
用prim算法实现最小生成树,要求输出为图形界面,实现入选,交换,调整等的功能-Minimum spanning tree algorithm with the prim, the output for the graphical interface required to achieve selected, exchange, adjustments and other features
-
-
0下载:
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
-
-
0下载:
普利姆算法 运用普利姆算法求取最小生成树 c实现算法-Puli Mu Puli Mu algorithm using minimum spanning tree algorithm to strike
-
-
0下载:
这是一个图论问题中最小生成树的一种构造算法。
按普里姆算法构造最小生成树的过程为:在所有“其一个顶点已经落在生成树上,而另一个顶点尚未落在生成树上”的边中取一条权值为最小的边,逐条加在生成树上,直至生成树中含有 n-1条边为止。
-This is a problem in graph theory, a minimum spanning tree construction algorithm. Primm constructed by the minimum spanning tree
-
-
0下载:
数据结构中有关图的创建,存储显示,深度,广度优先遍历算法,以及最小生成树Prim和Kruscal算法实现-The map data structure to create, store display, the depth, breadth-first traversal algorithm, and Prim minimum spanning tree algorithm and Kruscal
-
-
0下载:
最小生成树算法,prime算法,绝对能运行-Minimum spanning tree algorithm, prime algorithm can certainly run
-
-
0下载:
用C语言编写的最小生成树的改进普林算法,可以从任意节点开始生成最小生成树-Written in C language, Princeton improved minimum spanning tree algorithm, starting from any node to generate the minimum spanning tree
-
-
0下载:
实现无向图及其基本操作;
利用Prim算法实现图的最小生成树;
利用Kruskal算法实现图的最小生成树。
-Achieve an undirected graph and its basic operations utilize Prim minimum spanning tree algorithm graph use Kruskal minimum spanning tree algorithm graph.
-
-
0下载:
用C++实现的最小生成树,使用Prim(普里姆)算法.-C++ achieved with the minimum spanning tree, using Prim (Prim) algorithm.
-
-
0下载:
最小生成树的普里姆算法PrimTree;在一个连通网的所有生成树中,各边的权值之和最小的那棵生成树称为该连通网的最小代价生成树(Minimum Cost Spanning Tree),简称为最小生成树。
-Prim minimum spanning tree algorithm in all spanning a communication network, the weight of each side and a minimum spanning tree is called the
-
-
0下载:
最小生成树prim算法,用于处理图论知识比较有用(Minimum spanning tree prim algorithm)
-
-
0下载:
最小生成树Prim算法的matlab实现,直接解压就OK(Matlab implementation of minimum spanning tree prim algorithm)
-