@hackage OrderedBits0.0.1.2

Efficient ordered (by popcount) enumeration of bits

Categories
License
BSD-3-Clause
Maintainer
choener@bioinf.uni-leipzig.de
Links
Versions
- 0.0.2.0 Fri, 14 Jun 2019
- 0.0.1.2 Mon, 27 Feb 2017
- 0.0.1.1 Thu, 1 Sep 2016
- 0.0.1.0 Thu, 19 Nov 2015
- 0.0.0.3 Wed, 18 Nov 2015
- 0.0.0.2 Tue, 14 Jul 2015

Installation
In your cabal file:
Tested Compilers
- 7.10.3
Dependencies (5)
- base >=4.7 && <5.0
- primitive >=0.5
- vector >=0.10
- bits >=0.4
- vector-algorithms >=0.6
Dependents (4)
@hackage/PrimitiveArray, @hackage/MutationOrder, @hackage/ADPfusionSet, @hackage/ADPfusion

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/

@hackage OrderedBits0.0.1.2

Categories

License

Maintainer

Links

Versions

Installation

Tested Compilers

Dependencies (5)

Dependents (4)

OrderedBits

Contact