The LinearSplit package

[Tags: bsd3, library]

The LinearSplit module implements partitioning the sequence of items to the subsequences in the order given. The items can be splitted using greedy heuristic or using linear partition algorithm to minimize the maximum cost over all ranges (see the 'The Algorithm Design Manual' by Steven S. Skiena..)


Properties

Versions0.1, 0.2, 0.2.1
Dependenciesarray, base (>=3.0.3.2 && <5), cmdargs (>=0.3), haskell98, QuickCheck (>=1.2.0.1)
LicenseBSD3
AuthorVitaliy Rukavishnikov
Maintainervirukav@gmail.com
CategoryAlgorithms
Home pagehttp://github.com/rukav/LinearSplit
Bug trackermailto:virukav@gmail.com
UploadedThu Feb 17 13:54:12 UTC 2011 by VitaliyRukavishnikov
Downloads400 total (28 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees