https://github.com/jgcmarins/mst-prim-kruskal
Clustering aggregation using Prim and Kruskal's MST algorithm
https://github.com/jgcmarins/mst-prim-kruskal
c clustering cpp gnuplot kruskal-algorithm minimum-spanning-trees mst prim-algorithm
Last synced: about 2 months ago
JSON representation
Clustering aggregation using Prim and Kruskal's MST algorithm
- Host: GitHub
- URL: https://github.com/jgcmarins/mst-prim-kruskal
- Owner: jgcmarins
- License: mit
- Created: 2017-06-02T13:03:03.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2017-06-06T11:46:44.000Z (about 8 years ago)
- Last Synced: 2025-04-30T03:39:35.448Z (about 2 months ago)
- Topics: c, clustering, cpp, gnuplot, kruskal-algorithm, minimum-spanning-trees, mst, prim-algorithm
- Language: C++
- Size: 115 KB
- Stars: 6
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# mst-prim-kruskal
Clustering aggregation using Prim and Kruskal's MST algorithm.
## What is it for?
### Prim
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.
### Kruskal
Given an integer number `k` and based on a union find structure, run Kruskal's algorithm to build `k` MST.
## Results
Check results [here](https://github.com/jgcmarins/mst-prim-kruskal/tree/master/results).
## How to use
```
$ make
$ make run
```
## References
[Graph Algorithms](https://github.com/mission-peace/interview/tree/master/C%2B%2B/Graph%20Algorithms)
## Notices
#### #1
This software is incomplete and have many things to be fixed.
#### #2
Sorry for my bad `C++`. It's been a long time :grimacing:
## License
[MIT](https://github.com/jgcmarins/mst-prim-kruskal/blob/master/LICENSE)