The OrderedBits package

[maintain]
Warnings:

This library provides efficient methods to enumerate all elements of a set in order of the population count, or the ordered enumerations of the elements of the powerset of a set. First, the empty set, then all 1-element sets, all 2-element sets, etc. Such enumerations are important for algorithms over unordered data sets. Examples include the travelling salesman problem and the closely related Hamiltonian path problem.


[Skip to ReadMe]

Properties

Versions0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.1.0, 0.0.1.1, 0.0.1.2, 0.0.1.2
Dependenciesbase (>=4.7 && <5.0), bits (>=0.4), primitive (>=0.5), vector (>=0.10), vector-algorithms (>=0.6) [details]
LicenseBSD3
CopyrightChristian Hoener zu Siederdissen, 2014 - 2016
AuthorChristian Hoener zu Siederdissen
Maintainerchoener@bioinf.uni-leipzig.de
Stabilityexperimental
CategoryData
Home pagehttps://github.com/choener/OrderedBits
Bug trackerhttps://github.com/choener/OrderedBits/issues
Source repositoryhead: git clone git://github.com/choener/OrderedBits
UploadedMon Feb 27 21:58:46 UTC 2017 by ChristianHoener

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for OrderedBits-0.0.1.2

Build Status

OrderedBits

The OrderedBits library provides methods to generate unboxed vectors of Ints (and others) ordered by their population count or Hamming distance to the 0 set. In other words, we enumerate the power set of a given input set.

Such an order is important for dynamic programming algorithms for Hamiltonian path problems and the travelling salesman problem.

Contact

Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany
choener@bioinf.uni-leipzig.de
http://www.bioinf.uni-leipzig.de/~choener/