pcst-fast
condav1.0.10A fast implementation of the Goemans-Williamson scheme for the PCST (prize-collecting Steiner tree/forest) problem.
License MIT AND BSD-3-Clause AND Apache-2.0permissive1 versions1 maintainers0 deps246 weekly dl
46
/ 100
Health
safe to use
[email protected] is safe to use (health: 46/100)
Health breakdown0 – 100
10/25
maintenance
3/20
popularity
25/25
security
6/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/conda/pcst-fastFirst published · 2024-10-25 18:45:52.404000+00:00
Last updated · 2025-10-07 14:48:22.754000+00:00