Description: 分别利用prim算法和kruskal算法实现求图的最小生成树,感觉学习最小生成树的时候有挺多问题,这里是一个用PRIM和KRUSKAL算法做的一个最小生成树算法-, Respectively, using prim algorithm and Kruskal Algorithm for Minimum Spanning Tree, Minimum Spanning Tree feels when learning挺多have problems, here is an algorithm with PRIM and KRUSKAL make a minimum spanning tree algorithm Platform: |
Size: 1024 |
Author:dialy |
Hits:
Description: 最小生成树是数据结构中图的一种重要应用,它的要求是从一个带权无向完全图中选择n-1条边并使这个图仍然连通...为了得到最小生成树,人们设计了很多算法,最著名的有prim算法和kruskal算法。-Minimum spanning tree data structure is an important application of graph, and its request is from a weighted undirected complete graph to select n-1 edges and the graph is still connected ... in order to get minimum spanning tree, it is designed a lot of algorithms, the most famous are prim algorithm and Kruskal algorithm. Platform: |
Size: 1024 |
Author:0000 |
Hits:
Description: 求最小代价生成树（Prim算法和Kruskal算法）-Order to minimize the cost of spanning tree (Prim algorithm and Kruskal algorithm) Platform: |
Size: 1024 |
Author: |
Hits:
Description: 基于C++研究Prim算法和Kruskal算法对不同疏密程度的图的处理能力-Research the Prim and Kruskal arithmetic s performance for diffrent Gragh! Platform: |
Size: 1024 |
Author:李进 |
Hits:
Description: 实验一：数据浓缩与图示
实验二：数据的预处理
实验三：家庭人均生活消费的主成份分析
实验四：家庭人均收入与支出指标的典型相关分析
实验五：用最短路算法求解航空票价最便宜的路线图
实验六：用prim算法和Kruskal算法求最小生成树-Experiment one: Data enrichment and icons
Second experiment: data preprocessing
Experiment III: Principal component analysis of household per capita consumption
Canonical correlation analysis per capita household income and expenditure targets: Experiment IV
Experiment five: The shortest path algorithm for solving the cheapest air fares roadmap
Experiment 6: Find the minimum spanning tree algorithm and Kruskal algorithm with prim Platform: |
Size: 43008 |
Author:chenlei |
Hits:
Description: 1.掌握图的基本存储方法：邻接矩阵和邻接表（本程序中使用邻接矩阵）；
2.掌握有关图的基本操作算法并能使用高级语言实现（本程序使用C语言）；
3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法；
4.掌握图的最小生成树的两种算法：prim算法和kruskal算法。
5.掌握图的最短路径的两种算法：DIJ算法和floyd算法。
-1 The basic storage methods mastered graph: adjacency matrix and adjacency list (the adjacency matrix used in the program)
2 master basic operations related to graph algorithms and high-level language can be used to achieve (the program uses C language)
3 master depth-first search and breadth-first traversal traversal search algorithm
4 master plans of the two minimum spanning tree algorithm:. Prim algorithm and kruskal algorithm.
5 master shortest path of two algorithms:. DIJ algorithm and floyd algorithm. Platform: |
Size: 4096 |
Author:奋斗菠萝 |
Hits:
Description: 最小生成树算法的动态演示，具有良好的交互性，支持用鼠标绘图和绘点，Prim算法和Kruskal算法两种的动态过程。-Dynamic presentation minimum spanning tree algorithm, with good interaction, support the use of the mouse for drawing and painting point, Prim algorithms and dynamic process of two of Kruskal' s algorithm. Platform: |
Size: 23552 |
Author:林铖 |
Hits:
Description: 采用prim算法和kruskal算法求最小生成树
采用dijkstra算法求从顶点到其他顶点的最短路径和最短路径长度。(Using prim algorithm and Kruskal algorithm to find minimum spanning tree Dijkstra algorithm is used to find the shortest path and the shortest path length from vertex to other vertices.) Platform: |
Size: 122880 |
Author:nativefaith
|
Hits:
Search - Prim算法和Kruskal算法