proxy.golang.org : github.com/Codehardt/go-setcover
Golang implementation of the Greedy Set Cover Algorithm that calculates the smallest combination of sets that covers all elements in that sets.
Registry
-
Source
- Documentation
- JSON
purl: pkg:golang/github.com/%21codehardt/go-setcover
Keywords:
algorithm
, combination
, cover
, coverage
, elements
, filter
, go
, golang
, greedy
, list
, minimal
, setcover
, sets
, smallest
, unique
License: MIT
Latest release: over 4 years ago
First release: over 4 years ago
Namespace: github.com/Codehardt
Stars: 0 on GitHub
Forks: 0 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: 18 days ago