The exact-cover package

[Tags:bsd3, library, test]

Fast solver for exact set cover problems (http://en.wikipedia.org/wiki/Exact_cover) using Algorithm X as described in the paper Dancing Links, by Donald Knuth, in Millennial Perspectives in Computer Science, P159, 2000 (https://arxiv.org/abs/cs/0011047).

To get started, see the documentation for the Math.ExactCover module below.

Build examples with cabal install -fbuildExamples or stack build --flag exact-cover:buildExamples. Examples include a Sudoku solver.


[Skip to Readme]

Properties

Versions 0.1.0.0
Dependencies base (>=4.6 && <4.10), boxes (<0.2), containers (==0.5.*), exact-cover (<0.2), safe (<0.4), vector (<0.12) [details]
License BSD3
Copyright (c) 2017, Arthur Lee
Author Arthur Lee
Maintainer me@arthur.li
Category Math, Algorithms
Home page https://github.com/arthurl/exact-cover
Bug tracker https://github.com/arthurl/exact-cover/issues
Source repository head: git clone https://github.com/arthurl/exact-cover
Uploaded Sat Apr 22 12:05:55 UTC 2017 by arthur
Distributions NixOS:0.1.0.0
Downloads 76 total (12 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Flags

NameDescriptionDefaultType
buildexamples

Build example executables.

DisabledManual

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for exact-cover

Readme for exact-cover-0.1.0.0

The exact-cover package

exact-cover is a Haskell library that implements a fast solver for exact cover problems using Algorithm X as described in the paper Dancing Links, by Donald Knuth, in Millennial Perspectives in Computer Science, P159, 2000.

See exact-cover on Hackage for more information.