I shall present combinatorial Gray codes for the set of noncrossing and nonnesting set partitions of length n and classical type, i.e. type A, B and D. Moreover, about the sets of nonnesting partitions of type A and B I shall present explicit designs of efficient algorithms for lexicographical combinatorial generation of such sets. This is a joint work with Alessandro Conflitti (CMUC).