文件名称:Kruskal
介绍说明－－下载内容均来自于网络，请自行研究使用
编程实现Kruskal算法，生成最小代价生成树，其中利用最小堆算法实现。
（随机生成n个点，且随机生成k条边，形成连通图）
根据输入的顶点数的不同，分析时间复杂度。-Implement Kruskal’s algorithm based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points (x,y) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
（随机生成n个点，且随机生成k条边，形成连通图）
根据输入的顶点数的不同，分析时间复杂度。-Implement Kruskal’s algorithm based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points (x,y) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
head.h
main.cpp
main.cpp