couplr
cranv1.2.1Optimal Pairing and Matching via Linear Assignment. Solves optimal pairing and matching problems using linear assignment algorithms. Provides implementations of the Hungarian method (Kuhn 1955) <doi:10.1002/nav.3800020109>, Jonker-Volgenant shortest path algorithm (Jonker and Volgenant 1987) <doi:10.1007/BF02278710>, Auction algorithm (Bertsekas 1988
License MIT + file LICENSE0 versions1 maintainers6 deps144 weekly dl
gcol33/couplr50
/ 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/couplrFirst published · 2026-03-20 17:23:23
Last updated · 2026-03-20T15:50:11+00:00