A Gray Code for the Ideals of a Forest P
β
Y. Koda; F. Ruskey
π
Article
π
1993
π
Elsevier Science
π
English
β 707 KB
We present two algorithms for listing all the ideals of a forest poset. These algorithms generate ideals in a gray code manner; that is, consecutive ideals differ by exactly one element. Both algorithms use storage \(O(n)\), where \(n\) is the number of elements in the poset. On each iteration, the