sahands/coroutine-generation

Using coroutines in Python for combinatorial generation. Includes code for binary strings in Gray order, multi-radix numbers in Gray order, Steinhaus-Johnson-Trotter for permutations in Gray order, Knuth-Ruskey for ideals of a completely acyclic poset in Gray order, Varol-Rotem for linear extensions of a poset, and Pruesse-Ruskey for signed linear extensions of a poset in Gray order.

Python