github.com/codehardt/go-setcover (go): Golang implementation of the Greedy Set Cover Algorithm that calculates the smallest combination of sets that covers all elements in that sets.
Keywords: algorithm|combination|cover|coverage|elements|filter|go|golang|greedy|list|minimal|setcover|sets|smallest|unique