OrderedBits: Efficient ordered (by popcount) enumeration of bits

[ bsd3, data, library ] [ Propose Tags ]

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.

Versions [RSS] [faq] 0.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.2.0 changelog.md base (>=4.7 && <5.0), bits (>=0.4), primitive (>=0.5), vector (>=0.10), vector-algorithms (>=0.6) [details] BSD-3-Clause Christian Hoener zu Siederdissen, 2014 - 2016 Christian Hoener zu Siederdissen choener@bioinf.uni-leipzig.de Data https://github.com/choener/OrderedBits https://github.com/choener/OrderedBits/issues head: git clone git://github.com/choener/OrderedBits by ChristianHoener at 2017-02-27T21:59:38Z NixOS:0.0.2.0, Stackage:0.0.2.0 5404 total (21 in the last 30 days) (no votes yet) [estimated by Bayesian average] λ λ λ Docs available Last success reported on 2017-02-27

Modules

[Index]

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

[back to package description]

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/