当前位置:
首页 资源下载
搜索资源 - Prim-minimum-spanning-tree-algorithm
搜索资源列表
-
0下载:
学习了解最小生成树,利用prim算法将已知树输入,然后生成最小生成树-Learn about the minimum spanning tree, using the prim algorithm will known tree input, and then generate minimum spanning tree
-
-
0下载:
最小生成树的Prim算法,利用Prim算法求解不带约束条件的连通图的最小生成树。-The minimum spanning tree Prim algorithm
-
-
0下载:
普利姆算法用来求解最小生成树问题很容易,使得树的最小权值最小。-Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree
-
-
0下载:
利用数据图结构实现最小生成树的普里姆算法-Use data figure structure realize the minimum spanning tree PuLiM algorithm
-
-
0下载:
This algorithm to find the minimum spanning tr-This is algorithm to find the minimum spanning tree
-
-
0下载:
此代码用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.
-
-
0下载:
最小生成树算法,prim算法,c语言实现-Minimum spanning tree algorithm, prim algorithm, c language
-
-
0下载:
本压缩包包括matlab的顶点覆盖近似算法、哈密尔顿回路、模拟退火应用、最大流和最小截、最短路和次短路、最短路径、最小生成树prim算法等,带有源程序和中文说明文档,此文件夹中的文件,如需被利用,则要直接放至work目录下。-The compressed packet including matlab vertex cover approximation algorithm, Hamilton circuit, simulated annealing, maximum flow and mini
-
-
0下载:
假设G=(V,E)是连通的,TE是G上最小生成树中边的集合。算法从U={u0}(u0∈V)、TE={}开始。重复执行下列操作:
在所有u∈U,v∈V-U的边(u,v)∈E中找一条权值最小的边(u0,v0)并入集合TE中,同时v0并入U,直到V=U为止。-Suppose G = (V, E) is connected, TE minimum spanning tree of G on the set of edges. Algorithm from U = {u0} (u0 ∈ V), TE
-
-
0下载:
数据结构与算法的经典例题, 求最小生成树的算法之一, prim算法。-Data Structures and Algorithms classic example, find the minimum spanning tree algorithms, prim algorithm.
-
-
0下载:
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
-
-
0下载:
prim算法输出一个最小生成树,prim算法最先是找到一个根节点,然后在继续生成最小生成树,这样就能找到一个最小生成树,如果是这样的话,我们可以用一个循环,把每一个节点当作根节点,再把重复的树删除,这样就能找到所有的最小生成树了-algorithm prim, prim algorithm was first to find a root node, and then continue to generate the minimum spanning tree, so that we can f
-
-
0下载:
实验一:数据浓缩与图示
实验二:数据的预处理
实验三:家庭人均生活消费的主成份分析
实验四:家庭人均收入与支出指标的典型相关分析
实验五:用最短路算法求解航空票价最便宜的路线图
实验六:用prim算法和Kruskal算法求最小生成树-Experiment one: Data enrichment and icons
Second experiment: data preprocessing
Experiment III: Principal component ana
-
-
0下载:
Prim算法,解决最小生成树问题,是图论中一个很重要的算法-Prim algorithm to solve the minimum spanning tree problem is a very important graph theory algorithms
-
-
0下载:
无向图应用问题
任务:如果以五向网表示n个城市之间通信网络的建设计划,顶点表示城市,边上的权表示该线路的造价,设计一个方案,使这个通讯网的总造价最低。
提示:这是一个求最小生成树的问题。n个城市名和各边的权值由用户输入,建立图的邻接矩阵,然后以Prim算法来求最小生成树,然后输出方案。
-
The application of an undirected graph
Task: If the five-way communications network, said ne
-
-
0下载:
1.掌握图的基本存储方法:邻接矩阵和邻接表(本程序中使用邻接矩阵);
2.掌握有关图的基本操作算法并能使用高级语言实现(本程序使用C语言);
3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法;
4.掌握图的最小生成树的两种算法:prim算法和kruskal算法。
5.掌握图的最短路径的两种算法:DIJ算法和floyd算法。
-1 The basic storage methods mastered graph: adjacency matrix and adjacency
-
-
0下载:
最小生成树prim算法的实现,代码结构清晰,适合初学者学习-The minimum spanning tree prim algorithm, code structure is clear, for beginners to learn
-
-
0下载:
C语言实现普里姆算法 根据无向网构造最小生成树-C language implementation Prim algorithm based on minimum spanning tree in undirected network structure
-
-
0下载:
构造最小生成树的常用方法是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.
-
-
0下载:
最小生成树算法,有n个城市可以用(n-1)条路将它们连通,求最小总路程的和。最小生成树算法,如Prim、Kruskal算法编写最小生成树程序输出最小生成树的各条边-Minimum spanning tree algorithm, there are n cities can use the (n-1) road will connect them, and find the smallest total distance. Respective sides of the minimum span
-