# The OrderedBits package

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

Versions | 0.0.0.1, 0.0.0.2, 0.0.0.3, 0.0.1.0, 0.0.1.1, 0.0.1.2 |
---|---|

Change log | changelog.md |

Dependencies | base (>=4.7 && <5.0), bits (>=0.4), primitive (>=0.5), vector (>=0.10), vector-algorithms (>=0.6) [details] |

License | BSD3 |

Copyright | Christian Hoener zu Siederdissen, 2014 - 2016 |

Author | Christian Hoener zu Siederdissen |

Maintainer | choener@bioinf.uni-leipzig.de |

Category | Data |

Home page | https://github.com/choener/OrderedBits |

Bug tracker | https://github.com/choener/OrderedBits/issues |

Source repository | head: git clone git://github.com/choener/OrderedBits |

Uploaded | Mon Feb 27 21:59:38 UTC 2017 by ChristianHoener |

Distributions | NixOS:0.0.1.2 |

Downloads | 536 total (21 in the last 30 days) |

Votes | |

Status | Docs available [build log] Last success reported on 2017-02-27 [all 1 reports] |

## Downloads

- OrderedBits-0.0.1.2.tar.gz [browse] (Cabal source package)
- Package description (included in the package)