https://github.com/yorgosbas/set-covering-algorithm

Given a number of sets with a number of universes,this algorithm finds the least sets with the most universes
https://github.com/yorgosbas/set-covering-algorithm

algorithms covering problem set setcoveringproblem

Last synced: about 2 months ago
JSON representation

Given a number of sets with a number of universes,this algorithm finds the least sets with the most universes

• Host: GitHub
• URL: https://github.com/yorgosbas/set-covering-algorithm
• Owner: YorgosBas
• License: mit
• Created: 2019-01-02T22:32:34.000Z (over 6 years ago)
• Default Branch: master
• Last Pushed: 2019-01-17T10:17:25.000Z (over 6 years ago)
• Last Synced: 2023-09-04T20:08:17.995Z (almost 2 years ago)
• Topics: algorithms, covering, problem, set, setcoveringproblem
• Language: C
• Size: 9.77 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Set Covering Algorithm

Given a number of sets with a number of universes,this algorithm finds the least sets with the most universes

# Tests

| PERSON | C | JAVA | C++ | GO | PYTHON | PHP |

| --- | --- | --- | --- | --- | --- | --- |

| 1 |  | X |  |  | X |  |

| 2 |  |  |  | X |  | X |

| 3 | X | X |  |  |  |  |

| 4 | X | X | X | X |  |  |

| 5 |  |  |  | X | X | X |

### Result

`Accepted : 4

Accepted : 5`