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 9 public repositories matching this topic...
Tiny, zero-dependencies, package which tries to mask sensitive data in arbitrary collections (map, set), errors, objects and strings.
-
Updated
May 17, 2024 - TypeScript
Implementation of the *Separate and Conquer* / *Covering*-Algorithm for scikit-learn
-
Updated
Jun 21, 2022 - Python
Compute arboricity and forest decomposition of graphs.
-
Updated
Aug 1, 2017 - C++
A simple implementation of the compact ILP formulation for the Set Covering problem
-
Updated
Aug 28, 2019 - C++
2015 Cimpress Tech Challenge
-
Updated
Apr 27, 2016 - Java
Given a number of sets with a number of universes,this algorithm finds the least sets with the most universes
-
Updated
Jan 17, 2019 - C
C++ Nonisomorphic Branch-and-Cut
-
Updated
Jan 31, 2024 - C++
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."