The set-cover package

[Tags:bsd3, library]

Solver for exact set cover problems. Included examples: Sudoku, 8 Queens, Soma Cube, Tetris Cube, Cube of L's, Logika's Baumeister puzzle. Generic algorithm allows to choose between slow but flexible Set from containers package and fast but cumbersome bitvectors.

Build examples with cabal install -fbuildExamples.

The package needs only Haskell 98.

Properties

Versions 0.0, 0.0.1, 0.0.2, 0.0.3, 0.0.4, 0.0.5, 0.0.5.1, 0.0.6, 0.0.7, 0.0.8
Dependencies array (>=0.1 && <0.5), base (==4.*), containers (>=0.4 && <0.6), set-cover, utility-ht (>=0.0.1 && <0.1) [details]
License BSD3
Author Henning Thielemann, Helmut Podhaisky
Maintainer Henning Thielemann <haskell@henning-thielemann.de>
Stability Unknown
Category Math, Algorithms
Home page http://code.haskell.org/~thielema/set-cover/
Source repository this: darcs get http://code.haskell.org/~thielema/set-cover/ --tag 0.0.2
head: darcs get http://code.haskell.org/~thielema/set-cover/
Uploaded Sun Sep 1 15:11:21 UTC 2013 by HenningThielemann
Distributions NixOS:0.0.8
Downloads 1231 total (54 in the last 30 days)
Votes
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Flags

NameDescriptionDefaultType
buildexamplesBuild example executablesDisabledAutomatic

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