excov
| Crates.io | excov |
| lib.rs | excov |
| version | |
| source | src |
| created_at | 2025-04-13 22:52:19.813974+00 |
| updated_at | 2025-04-13 22:52:19.813974+00 |
| description | A solver for exact cover problems |
| homepage | |
| repository | https://github.com/earhart/excov |
| max_upload_size | |
| id | 1632212 |
| Cargo.toml error: | TOML parse error at line 17, column 1 | 17 | autolib = false | ^^^^^^^ unknown field `autolib`, expected one of `name`, `version`, `edition`, `authors`, `description`, `readme`, `license`, `repository`, `homepage`, `documentation`, `build`, `resolver`, `links`, `default-run`, `default_dash_run`, `rust-version`, `rust_dash_version`, `rust_version`, `license-file`, `license_dash_file`, `license_file`, `licenseFile`, `license_capital_file`, `forced-target`, `forced_dash_target`, `autobins`, `autotests`, `autoexamples`, `autobenches`, `publish`, `metadata`, `keywords`, `categories`, `exclude`, `include` |
| size | 0 |
Rob Earhart (earhart)
documentation
README
Excov
This package is an implementation of Knuth's Algorithm X using DLX.
This is just my little starter project to explore Rust. That said, the implementation is meant to be relatively simple and efficient, and I'd deeply appreciate any comments on how to make the code better.
Knuth's Algorithm X solves exact cover problems -- see the wikipedia article for details. But basically: if you have a set X, and a set S of subsets of X (so, each element of S contains some number of elements of X), can you find a subset of S s.t. each element of X is contained in exactly one subset? Essentially, this partitions X, with no elements in X left over.
This is useful for things like solving Sudoku puzzles or the N Queens puzzle.