Working on the join graph I faced some deficiencies in DynamicBitset, even though it is possible to work them around I believe it is better to add the missing functionality to the class:

• bool test(size_t index): presented in std::bitset and boost::dynamic_bitset. Workaround: use operator[], but that involves creating a temporarily object.
• void clear(): presented in boost::dynamic_bitset and std::bitset, workaround: create an empty bitset and &= with the one to clear. This involves a creating unnecessary object.
• bool all(): this was never added to DynamicBitset because DynamicBitset doesn't have a notion of size. Yet we can implement a useful all by passing an actual size to it. Something like: bool allInPrefix(size_t prefixSize).