mstclustering

cranv1.0.0.0

"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>.

License AGPL (>= 3)0 versions1 maintainers2 deps71 weekly dl
https://CRAN.R-project.org/package=mstclustering
36
/ 100
Health
use with caution

[email protected] low health (36/100) — consider alternatives

  • Low health score (36/100)
Health breakdown0 – 100
0/25
maintenance
0/20
popularity
25/25
security
9/15
maturity
2/15
community
Vulnerabilities
0
none known

Health History

Dependency Tree

License Audit

Dependencies (2)
API access

Get this data programmatically — free, no authentication.

curl https://depscope.dev/api/check/cran/mstclustering

First published · 2022-02-08 10:02:33

Last updated · 2022-02-08T07:40:02+00:00

mstclustering — Health Score 36/100 | DepScope