搜索资源列表
Kruskal
- 这是最小生成树Kruskal算法用C语言实现的程序。-This is the Kruskal minimum spanning tree algorithm using C language program.
Kruskal
- 设G=(V,E)是一个具有含权边的连通无向图。G的一颗生成树(V,T)是G的作为树的子图。如给该连通图加权并且各边的权和为最小值,那么(V,T)就称为最小耗费生成树或简称最小生成树。 Kruskal的算法概况如下: 对G的边以非降序权重排列。 对排序表中的每条边,如果现在把它放入T中的话不会形成回路,则把它加入到生成树T中,否则将它丢弃。-Let G = (V, E) is an edge with the right connectivity with undire
kruskal
- kruskal算法 用于计算最短路径的基于最小生成树的算法-kruskal used to calculate the shortest path algorithm based on minimum spanning tree algorithm
shumoshiyan
- 实验一:数据浓缩与图示 实验二:数据的预处理 实验三:家庭人均生活消费的主成份分析 实验四:家庭人均收入与支出指标的典型相关分析 实验五:用最短路算法求解航空票价最便宜的路线图 实验六:用prim算法和Kruskal算法求最小生成树-Experiment one: Data enrichment and icons Second experiment: data preprocessing Experiment III: Principal component ana
kruskal
- 该代码为kruskal算法求最小生成树的代码,包括了从生成树的构建到最小生成树的生成全过程-The code for the minimum spanning tree algorithm for kruskal code, including the spanning tree generated from the build to the minimum spanning tree of the entire process
mintree
- 一个连通图可以有多个生成树,实际应用中希望所选的生成树的权值总和最小,这就是最小生成树的问题。代码实现用Kruskal算法实现求解最小生成树。-A connected graph can have multiple spanning tree, hope in the actual application of the selected total weight minimum spanning tree, this is the minimum spanning tree problem. C
minimum-spanning-tree_Kruskal
- 一个C++实现的最小生成树,使用的是Kruskal(克鲁斯卡尔)算法.-C++ achieve a minimum spanning tree, using the Kruskal (Kruskal) algorithm.
kruskal
- 求加权连通图的最小生成树的算法示例,两个经典的最小生成树算法的较为简单理解的一个算法-Find weighted connected graph algorithm examples of the minimum spanning tree, two classic minimum spanning tree algorithm is relatively simple to understand an algorithm
main
- 1.掌握图的基本存储方法:邻接矩阵和邻接表(本程序中使用邻接矩阵); 2.掌握有关图的基本操作算法并能使用高级语言实现(本程序使用C语言); 3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法; 4.掌握图的最小生成树的两种算法:prim算法和kruskal算法。 5.掌握图的最短路径的两种算法:DIJ算法和floyd算法。 -1 The basic storage methods mastered graph: adjacency matrix and adjacency
kruskal
- This function finds the minimum spanning tree of the graph where each edge has a specified weight using the Kruskal s algorithm.-This function finds the minimum spanning tree of the graph where each edge has a specified weight using the Kruska
kruskal
- spanning tree algorithm with Penang, Malaysia maps demo
graph
- 掌握图的两种存储结构; 掌握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
WeightedUndi_Kruskal
- 以Kruskal算法构造图所示带权无向图的最小生成树。-Kruskal algorithm is shown to construct a weighted undirected graph diagram minimum spanning tree.
kruskal
- Implementation of kruskal s algorithm
Kruskal
- This an implementation of Kruskal s Algorithm using adjacency matrix.
kruskal
- Kruskal s Algorithm for finding Minimum Spanning Tr-Kruskal s Algorithm for finding Minimum Spanning Tree
KruskalAlgorithm
- Kruskal algorithm in Java 2
KRUSKAL
- Implementation of kruskals algorithm
Graph
- 基于Virtual C++的数据结构中图的应用,能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出,同时能实现无向图的深度遍历输出和广度遍历输出;kruskal算法和Prim算法实现最小生成树的创建;Dijkstra算法实现最短路径的计算;以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs
kruskal
- Implementation of Kruskal s algorithm