搜索资源列表
-
0下载:
(数据结构)用Prim算法构造最小生成树,是图的一种重要应用,它的要求是从一个带权无向完全图中选择n-1条边并使这个图仍然连通,同时还要考虑使树的权最小-(Data structure) Prim algorithm constructs the minimum spanning tree
-
-
0下载:
0、显示该图的邻接矩阵1、广度优先遍历2、深度优先遍历3、最小生成树PRIM算法-0, the adjacency matrix
1 breadth-first traversal
2, depth-first traversal
3, the minimum spanning tree PRIM algorithm
-
-
0下载:
用最小生成树解决旅行家问题 用到了prim算法 近似算法-Used in the prim algorithm approximation algorithm for minimum spanning tree to solve the problem of travelers
-
-
0下载:
(1)键盘输入数据,建立一个有向图的邻接表。
(2)输出该邻接表。
(3)建立一个无向图的十字链表。
(4)在有向图的邻接表的基础上计算各顶点的度,并输出。
(5)采用邻接表存储实现无向图的深度优先遍历。。
(6)采用邻接表存储实现无向图的广度优先遍历。
(7)以有向图的邻接表为基础实现并输出它的拓扑排序序列
(8)采用邻接矩阵存储实现无向图的最小生成树的PRIM算法。
(9)在主函数中设计一个简单的菜单,分别调试上述算法。-(1) keyboard input
-
-
0下载:
1. 利用克鲁斯卡尔算法求网的最小生成树。
2. 利用普里姆算法求网的最小生成树。
3. 要求输出各条边及它们的权值。-1. Using Kruskal algorithm for the minimum spanning tree network. 2. Use of the the prim algorithm for the minimum spanning tree. 3. Output edge and their weights.
-
-
0下载:
通信网中图论部分PRIM算法生成最小生成树的matlab程序-Communication network center theory of some PRIM algorithm to generate minimum spanning tree of the matlab program
-
-
0下载:
Prim算法
用Prim算法从u0出发构造网g的最小代价生成树-Prim Algorithm Prim algorithm constructed starting from u0 minimum cost spanning tree network g
-
-
0下载:
可以用prim算法来生成最小生成树,对于数据结构的学习者有一定参考意义-Prim algorithm can be used to generate the minimum spanning tree data structure for learners are meaningful
-
-
0下载:
掌握图的两种存储结构;
掌握Dijkstra算法;
掌握Prim及Kruskal算法;
邻接矩阵、最短路径及其长度
邻接表、最小生成树
-Learn two storage structure
Master Dijkstra algorithm
Master Prim and Kruskal algorithm
Adjacency matrix, and the length of the shortest path
Adjac
-
-
0下载:
VC++实现最小耗费生成树(Prim算法)-VC++ to achieve the minimum cost spanning tree (Prim algorithm)
-
-
0下载:
In computer science, Prim s algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight o
-
-
0下载:
丛林中的路,利用最小生成树的prim(普利姆)算法,找最小值-Jungle road, using the minimum spanning tree prim (premium) algorithm, to find the minimum value
-
-
0下载:
1)编程实现背包问题贪心算法和最小生成树prim算法。通过具体算法理解如何通过局部最优实现全局最优,并验证算法的时间复杂性。
2)输入5个的图的邻接矩阵,程序加入统计prim算法访问图的节点数和边数的语句。
3) 将统计数与复杂性函数所计算的比较次数比较,用表格列出比较结果,给出文字分析。
4)背包问题的实验数据如下表:n=8,m=110
-1) programming to implement the knapsack problem greedy algorithm and
-
-
0下载:
用普里姆(Prim)算法构造最小生成树;图的DFS算法的非递归遍历函数-She (Prim) algorithm to construct minimum spanning tree
-
-
0下载:
此程序使用最小生成树Prim算法,用户输入图的输入文件名,程序读此文件-This procedure using minimum spanning tree Prim algorithm, user input figure input file name, program to read this file
-
-
0下载:
此程序使用最小生成树Prim算法,用户输入图的输入文件名,程序读此文件-This procedure using minimum spanning tree Prim algorithm, user input figure input file name, program to read this file
-
-
0下载:
此程序使用最小生成树Prim算法,用户输入图的输入文件名,程序读此文件(This procedure using minimum spanning tree Prim algorithm, user input figure input file name, program to read this file)
-
-
0下载:
给定一个地区的n个城市间的距离网,用Prim算法或Kruskal算法建立最小生成树,并计算得到的最小生成树的代价。(Given a distance network between n cities in a region, a minimum spanning tree is constructed by using Prim algorithm or Kruskal algorithm, and the cost of the minimum spanning tree is calcula
-
-
0下载:
小生成树其实是最小权重生成树的简称。一个有n个结点的连通图的生成树是原图的极小连通子图,且包含原图中的所有n个结点,并且有保持图连通的最少的边。最小生成树可以用kruskal(克鲁斯卡尔)算法或Prim(普里姆)算法求出。(The young adult tree is actually the abbreviation of the minimum power regeneration. The spanning tree of a connected graph with n nodes i
-
-
0下载:
1、定义邻接矩阵存储的图类Graph_Matrix .
2、实验验证如下算法的正确性、各种功能及指标:
1)创建一个邻接矩阵存储的图;
2)返回图中指定边的权值;
3)查找图中某顶点的第一个邻接顶点、某顶点关于另一个顶点的下一个邻接顶点序号;
3、4)图的深度优先遍历;
5)基于普里姆算法求最小支撑树。【选作】(1. Define the graph class Graph_Matrix which is stored by the adjacency matrix.
2. The
-
«
1
2
...
5
6
7
8
9
1011
»