Python implementation of Knuth's Dancing Links (dlx) algorithm to solve set cover. Extremely efficient at solving Sudoku and combinatorial design problems.
-
Updated
Feb 16, 2023 - Python
#
covering
Here are 2 public repositories matching this topic...
Implementation of the *Separate and Conquer* / *Covering*-Algorithm for scikit-learn
-
Updated
Jun 21, 2022 - Python
Improve this page
Add a description, image, and links to the covering topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the covering topic, visit your repo's landing page and select "manage topics."