Searching for combinatorial covers.
Project description
CombCov
A generalization of the permutation-specific algorithm Struct -- extended for other types of combinatorial objects.
Demo
Take a look at demo/string_set.py
as an example on how to use CombCov
with
your own combinatorial object. It finds a String Set cover for the set of
string over the alphabet {a,b}
that avoids the substring aa
(meaning no
string in the set contains aa
as a substring).
python -m demo.string_set
It prints out the following:
Trying to find a cover for ''*Av(aa) over ∑={a,b} using elements up to size 7.
(Enumeration: [1, 2, 3, 5, 8, 13, 21, 34])
Solution nr. 1:
- ''*Av(a,b) over ∑={a,b}
- 'a'*Av(a,b) over ∑={a,b}
- 'b'*Av(aa) over ∑={a,b}
- 'ab'*Av(aa) over ∑={a,b}
Development
Run unittests (with coverage for the demo
module as well):
python setup.py test --addopts --cov=demo
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
CombCov-0.0.2.tar.gz
(3.8 kB
view hashes)