Description: 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.
To Search:
File list (Check if you may need any files):
head.h
main.cpp
Download