Location:
Search - prim
Search list
Description: 这是我用net写的一个prim算法计算最小生成树的程序,欢迎大家下载()
Platform: |
Size: 71680 |
Author: lookmxt
|
Hits:
Description: 最小生成书构造：本次报告介绍的是最小生成树求解的方法，通过Prim算法和Kruskal算法这两种不同的方法分别求解最小生成树。(Minimum spanning Book Construction)
Platform: |
Size: 11264 |
Author: 百劫
|
Hits:
Description: C++最小生成树算法，提供给算法爱好者学习，有图的基本概念，邻接矩阵，prim算法等(Minimum spanning tree algorithm)
Platform: |
Size: 1039360 |
Author: LQH
|
Hits:
Description: 本工程包含二叉树和图的相关基本操作，源码包括二叉树的前序、中序、后序、层次遍历，求树高和树宽，创建、删除二叉树或某个结点，通过前序和中序序列得后序序列；图的创建（邻接矩阵或邻接表表示），深度优先和广度优先搜索，求关键路径，普里姆算法求最小生成树等，放到Visual C++工作区即可使用。(This project contains the basic operation of the binary tree and the graph. The source code includes the preorder, inorder, postorder, level traversal of the binary tree, tree height and tree width, create and delete binary tree or a node, through the preface and inorder sequence create postorder sequence; graph creation(the adjacency matrix or adjacency list representation), depth-first and breadth-first search, find the critical path, and find the minimum spanning tree based on the Prim algorithm, all of which can be used in the Visual C ++ workspace.)
Platform: |
Size: 1800192 |
Author: 太阳倘若失眠
|
Hits:
Description: 这是一个程序算法,主要描述的上PRIM算法,用C编写的()
Platform: |
Size: 20480 |
Author: gucgel |
Hits:
Description: 这是我用net写的一个prim算法计算最小生成树的程序,欢迎大家下载()
Platform: |
Size: 102400 |
Author: coianeiencal |
Hits:
Description: 小生成树其实是最小权重生成树的简称。一个有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 is the minimal connected subgraph of the original graph, and contains all n nodes in the original graph, and has the least edge to keep the graph connected. The minimum spanning tree can be obtained using kruskal (kruskal) algorithm or Prim (Prim) algorithm.)
Platform: |
Size: 4096 |
Author: lina111 |
Hits:
Description: 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 experiment verifies the correctness of the following algorithms, various functions and indicators.
1) create a graph of adjacency matrix storage.
2) return map refers to the weight of dingbian;
3) find the first adjacency vertex of a vertex in a graph, and the next vertex sequence number of one vertex on another vertex;
3, 4) the depth first traversal of the graph;
5) prim algorithm for minimum spanning tree based on. [selected])
Platform: |
Size: 2328576 |
Author: kaiser1998 |
Hits:
Description: 4 6 prim rar this is a very important problem div hr div B 文件列表 B ： div()
Platform: |
Size: 4096 |
Author: WL_668351 |
Hits:
Description: 本文件包含最小生成树程序，深度优先搜索，广度优先搜索，prim算法等，满足对树状图学习的小伙伴们下载，绝对是良心推荐，可以直接运行程序。(This file contains minimum spanning tree program, depth first search, breadth first search, PRIM algorithm, etc., which satisfies the downloads of tree learning partners. It is absolutely recommended by conscience, and can run directly.)
Platform: |
Size: 6144 |
Author: 李乃双 |
Hits:
Description: 对任意给定的网络顶点数和边数自定,建立它的邻接矩阵并输出,然后利用Prim算法或Kruskal算法生成它的最小生成树,()
Platform: |
Size: 10240 |
Author: elemini |
Hits:
Description: prim算法：可以从任意结点出发,找出与之相连的最小权值的结点,连接,把连接后的结点看成是一个整体,和其他的结点的权值比较()
Platform: |
Size: 14336 |
Author: Rachhl |
Hits:
Description: 本程序是用来prim算法用C++的完全实现,可供大家学习使用()
Platform: |
Size: 270336 |
Author: PSxkckp%24894053 |
Hits:
Description: 最小生成树就是：
在所有数据满足是一棵树的情况下一条将所有节点都连接起来且长度最短的一条路（因为任意两个节点之间有权值
（相连的两点之间权值为一个具体的数，不相连的两个点之间权值为无穷大））
下面介绍通用的求最小生成树的两种算法：(The smallest spanning tree is:
When all data satisfy a tree, a path that connects all nodes is the shortest one, because there is any weight between two nodes.
The weight between two points is a specific number. The weights between the two points are infinite.
Here are two general algorithms for finding minimum spanning tree.)
Platform: |
Size: 15360 |
Author: zhych233 |
Hits:
Description: 现有一个景区，景区里面有若干个景点。现欲开发景区信息管理系统，对景点的信息进行管理。使用图的数据结构来保存景区景点信息，为用户提供创建图、查询景点信息、旅游景点导航、搜索最短路径、铺设电路规划等功能。
使用C++语言，通过对景区信息管理系统的四次迭代开发，实现以下主要学习目标：
1)掌握图的定义和图的存储结构，图的创建方法及其应用
2)掌握图的两种遍历方法及其应用
3)掌握迪杰特斯拉（Dijkstra）算法及其应用
4)理解最小生成树的概念、掌握普里姆（Prim）算法及应用(There is a scenic spot and there are several scenic spots in it. Now we want to develop the information management system of scenic spots and manage the information of scenic spots. The data structure of the map is used to preserve the scenic spots information, providing the users with the functions of creating maps, inquiring the information of the scenic spots, the navigation of the tourist attractions, the shortest path searching, the layout of the layout of the circuit and so on.
Using C++ language, the following four main learning objectives are achieved through the development of the scenic area information management system.
1) master the definition and storage structure of graph, create method and application of graph.
2) the two traversing methods of mastering the graph and its application
3) Master Diedje Tesla (Dijkstra) algorithm and its application.
4) understand the concept of minimum spanning tree, master Prim algorithm and application.)
Platform: |
Size: 5120000 |
Author: haimaianbaobao |
Hits:
Description: （1）城市间的距离网采用邻接矩阵表示，邻接矩阵的存储结构定义采用课本上的定义，若两个城市之间不存在道路，则将相应边的权值设为自己定义的无穷大值。要求在屏幕上显示得到的最小生成树中包括那些城市间的道路，并显示得到的最小生成树的代价。
（2）表示城市间距离网的邻接矩阵（要求至少6个城市，10条边）
（3）最小生成树中包括的边及其权值，并显示得到的最小生成树的代价。(1) the distance network between cities is expressed by adjacency matrix, and the storage structure of the adjacency matrix is defined by the definition of the textbook. If there is no road between the two cities, the weight value of the corresponding edge is set to the infinite value of its own definition. The minimum spanning tree required to be displayed on the screen includes those intercity roads and shows the cost of the minimum spanning tree.
(2) denote the adjacency matrix of the distance network between cities (requiring at least 6 cities, 10 sides).
(3) the edges and weights of the minimum spanning tree and the cost of the minimum spanning tree.)
Platform: |
Size: 2048 |
Author: ac流川枫 |
Hits:
«
1
2
...
28
29
30
31
32
33»