lumbermark
cranv0.9.0Resistant Clustering via Chopping Up Mutual Reachability Minimum Spanning Trees. Implements a fast and resistant divisive clustering algorithm which identifies a specified number of clusters: 'lumbermark' iteratively chops off sizeable limbs that are joined by protruding segments of a dataset's mutual reachability minimum spanning tree; see Gagolewski (2026) <https://lumbermark
License AGPL-3network copyleft0 versions1 maintainers2 deps118 weekly dl
gagolews/lumbermark50
/ 100
Health
safe to use
[email protected] is safe to use (health: 50/100)
Health breakdown0 – 100
20/25
maintenance
3/20
popularity
25/25
security
0/15
maturity
2/15
community
Vulnerabilities
0
none known
Health History
Dependency Tree
License Audit
API access
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/cran/lumbermarkFirst published · 2026-03-16 19:40:00
Last updated · 2026-03-16T18:10:02+00:00