mstclustering
"MST-Based Clustering"
Implements a minimum-spanning-tree-based heuristic for k-means clustering using a union-find disjoint set and the algorithm in Kruskal (1956) <doi:10.1090/S0002-9939-1956-0078686-7>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.0.0 |
rolling linux/jammy R-4.5 | mstclustering_1.0.0.0.tar.gz |
22.5 KiB |
1.0.0.0 |
rolling linux/noble R-4.5 | mstclustering_1.0.0.0.tar.gz |
22.4 KiB |
1.0.0.0 |
rolling source/ R- | mstclustering_1.0.0.0.tar.gz |
3.4 KiB |
1.0.0.0 |
latest linux/jammy R-4.5 | mstclustering_1.0.0.0.tar.gz |
22.5 KiB |
1.0.0.0 |
latest linux/noble R-4.5 | mstclustering_1.0.0.0.tar.gz |
22.4 KiB |
1.0.0.0 |
latest source/ R- | mstclustering_1.0.0.0.tar.gz |
3.4 KiB |
1.0.0.0 |
2026-04-26 source/ R- | mstclustering_1.0.0.0.tar.gz |
3.4 KiB |
1.0.0.0 |
2026-04-23 source/ R- | mstclustering_1.0.0.0.tar.gz |
3.4 KiB |
1.0.0.0 |
2026-04-09 windows/windows R-4.5 | mstclustering_1.0.0.0.zip |
25.7 KiB |
1.0.0.0 |
2025-04-20 source/ R- | mstclustering_1.0.0.0.tar.gz |
3.4 KiB |