OrderedBits: enumeration of Ints by population count.

The development of OrderedBits continues within the Generalized ADP framework. The OrderedBits library is mainly used for dynamic programming algorithms on sets, where each active element is represented by a bit.

README

(included from project) Christian Höner zu Siederdissen - OrderedBits

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/

hackage
 sources
 bugtracker
 Build Status
Stable Sources git Bugtracker Build Status

Usage of this library in a Haskell project:

This package provides no "main" executable, but rather only library functionality. (Though sometimes tools, or example programs are provided). Usage requires some knowledge of Haskell.
  1. Include the library in your cabal file.
  2. Use stack to simplify development. This will require adding the library with an exact version to the stack.yaml file. This includes the option to include this library directly from its github repository.