Clustering aggregation using Prim and Kruskal's MST algorithm.
Given an integer number k, run Prim's algorithm to build a MST based on a priority queue. Then remove the k edges with higher weight. This will produce k+1 clusters.
Given an integer number k and based on a union find structure, run Kruskal's algorithm to build k MST.
Check results here.
$ make
$ make run
This software is incomplete and have many things to be fixed.
Sorry for my bad C++. It's been a long time 😬