搜索资源列表
-
0下载:
图的大部分实现 图的深度优先周游 图的广度优先周游 由队列方式实现的拓扑排序 由深度优先搜索方式实现的拓扑排序 单源最短路径(Dijkstra算法) 每对顶点之间的最短路径(Floyd算法) 最小支撑树(Prim算法) 最小支撑树(Kruskal算法)-Figure most of the implementation diagram of the depth-first breadth-first tour travel map be achieved by the topological s
-
-
1下载:
课程设计题目∶
设计程序完成如下功能:
对给定的网和起点,实现求解最小生成树的PRIM算法,并给出求解过程的动态演示。-Curriculum topics: design process is complete the following functions: For a given network and the starting point to achieve the PRIM algorithm for solving minimum spanning tree, and giv
-
-
0下载:
最小生成树prim算法,Dandn文件给出了输入参数的名称及格式即在调用prim前先输入邻接矩阵D和节点个数n输入prim得到两行的矩阵T,将上下两行数字对应的节点相连即可-Prim algorithm for minimum spanning tree, Dandn document gives the name and format of the input parameters that is called prim before Input adjacency matrix D and
-
-
0下载:
本程序用C语言实现了Prim算法求解最小生成树问题-The program uses C language to implement the Prim algorithm for minimum spanning tree problem
-
-
0下载:
普利姆算法的C++实例演示。用于求无向网的最小代价生成树-Pliem algorithm C++ instance of the presentation. Undirected network for minimum cost Spanning Tree ... ... ... ...
-
-
0下载:
对右边的无向带权图,按普里姆算法求其最小生成树-On the right side of undirected weighted graph, by Prim algorithm to solve the minimum spanning tree
-
-
0下载:
用prim算法求带权图的最小生成树,最小生成树的边集合存在mst数组中-With prim algorithm for getting the right plan with the minimum spanning tree, minimum spanning tree of the edge set of the array there mst
-
-
0下载:
对于如图8.30所示的无向带权图G,采用普里姆算法输出从顶点0出发的最小生成树。-As shown in Figure 8.30 for the undirected weighted graph G, using Prim algorithm output starting from the vertex 0 the minimum spanning tree.
-
-
0下载:
Two algorithm template(Kruskal Algorithm and Prim Algorithm) to help you get a Minimum Spanning Tr-Two algorithm template(Kruskal Algorithm and Prim Algorithm) to help you get a Minimum Spanning Tree
-
-
0下载:
数据结构——邻接矩阵表示图,普里姆算法程序实现最小生成树-Data structure- adjacency matrix graph, Prim algorithm for minimum spanning tree procedure
-
-
0下载:
prim algorithm for minimum spanning tr-prim algorithm for minimum spanning tree
-
-
0下载:
A C++ Program to implement the Prim s Algorithm to solve Minimum Spanning Tree Problem (MST).
-
-
0下载:
显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树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
-
-
0下载:
深度优先遍历
广度优先遍历
最小生成树PRIM算法
最小生成树KRUSCAL算法
-Breadth-first traversal depth-first traversal algorithm for minimum spanning tree minimum spanning tree KRUSCAL PRIM algorithm
-
-
0下载:
(1) 掌握图的邻接矩阵、邻接表、十字链表等不同存储形式的表示方法。
(2) 掌握图的两种不同遍历方法的基本思想并能编程实现。
(3) 掌握构造最小生成树的两种算法,即Prim 算法和Kruscal算法的思想,并能编程实现。
(4) 能够灵活运用图的相关算法解决相应的实际问题。
-(1) master the adjacency matrix, adjacency list, cross-linked forms of representation of different st
-
-
0下载:
本程序采用数据结构中提到的Prim算法来求给出的一个图的最小生成树,运行程序之后会显示出最小生成树的起点到每个边节点即构成最小生成树的边,并且会显示出每条边的权值。-The program adopt the frequently used Prim algorithm to generate a minimum spanning tree, when you run the program, it will show the edge of the minimum spanning tree
-
-
1下载:
本软件围绕无向图的应用这一主题,用图形化的界面实现了无向图的建立、显示邻接表、动态构造最小生成树(分别利用Prim算法和Kruscal算法)、查找最短路径等功能。
具体功能:
给定一个图,完成:
(1) 建立并显示出它的邻接链表
(2) 分别用普里姆算法和克鲁斯卡尔算法构造其最小生成树,随时显示其构造的过程
(3) 给出某一确定顶点到所有其他顶点的最短路径
(4) 给出每一对顶点之间的最短路径
说明:程序开发时所用的文件和源码在文件夹“配套文件”中提供。另附说明
-
-
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
-