The set-cover package

[ Tags: algorithms, bsd3, library, math ] [ Propose Tags ]

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, 0.0.9
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>
Category Math, Algorithms
Home page http://code.haskell.org/~thielema/set-cover/
Source repo this: darcs get http://code.haskell.org/~thielema/set-cover/ --tag 0.0.3
head: darcs get http://code.haskell.org/~thielema/set-cover/
Uploaded Sun Sep 1 15:51:54 UTC 2013 by HenningThielemann
Distributions LTSHaskell:0.0.8, NixOS:0.0.8, Stackage:0.0.8, openSUSE:0.0.8
Executables baumeister, lcube, sudoku-setcover, queen8, soma-cube, tetris-cube
Downloads 2727 total (87 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Flags

NameDescriptionDefaultType
buildexamples

Build example executables

DisabledAutomatic

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