Hellp! I would like to generate all possible partitions of length n with k clusters. It should be noted that the labels of the classes are irrelevant. Thanks for any suggestions! Best regards, Ales Ziberna
I have posed this question earlier, however it has probably not been clear enough. My problem is such. I would like to find all possible partitions of a set of n objects into k groups. The ordering of the groups does not matter, only which objects are together matters. For example, there are two possible partitions of 3 objects into 2 groups: 1 1 2 1 2 2 By "the labels are not important" I meant that a partition 1 1 2 is identical to the partition 2 2 1. Best regards, Ales Ziberna