BDD-based integer set representation.
This is not a BDD library. This is a memory-efficient set representation when there exist a lot of redundant and overlapping sets. The idea is derived from a paper (Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams) by Zhang et al.
The BDD implementation is simplified and optimized from the original BDD implementation by Jean-Christophe: link.
- ./configure --prefix=path
- make