muRty

cranv0.3.1

Murty's Algorithm for k-Best Assignments. Calculates k-best solutions and costs for an assignment problem following the method outlined in Murty (1968) <doi:10.1287/opre.16.3.682>.

License MIT + file LICENSE0 versions1 maintainers2 deps154 weekly dl
arg0naut91/muRty
42
/ 100
Health
safe to use

[email protected] is safe to use (health: 42/100)

Health breakdown0 – 100
0/25
maintenance
3/20
popularity
25/25
security
12/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/muRty

First published · 2020-02-29 15:08:28

Last updated · 2020-02-29T12:40:06+00:00