get all combinations between set elements

Asked Mar 06 '13 at 15:07

Active Mar 06 '13 at 15:26

Viewed 197 times

given a vector > SETS such that

SETS[0] = {1,2,3}
SETS[1] = {11,22,33}
SETS[2] = {111,222,333}

I want to create all the vectors

{1,11,111} ... {1,11,333}, {1,22,111} ... {1,22,333} ... {3,11,111} ... {3,33,333}

I've looked for it in boost doc but didn't find anything. Before than writing the code on my own, is there any library containing a function solving this problem?

edited Mar 06 '13 at 15:17

Bernhard Barker

54,589
14
104
138

asked Mar 06 '13 at 15:07

user1403546

1,680
4
22
43

2

1) I doubt any library would provide this functionality. 2) It shouldn't be difficult to write code to do this. 3) I saw an almost identical question on StackOverflow not too long ago (but I'm not going to go looking for it). And I'm sure there are many other near-identical questions. – Bernhard Barker Mar 06 '13 at 15:16
`next_permutation` much? – Bartek Banachewicz Mar 06 '13 at 15:19
i think next_permutation solves this problem only if the three sets have the same number of elements... i'd like a more general algorithm – user1403546 Mar 06 '13 at 15:22
@BartekBanachewicz: This isn't a permutation, it's a cartesian product. – interjay Mar 06 '13 at 15:22
Roll your own. Simple recursion will do it nicely. – Jack Aidley Mar 06 '13 at 15:23
@interjay hmm, then recursive `for` loop will do. – Bartek Banachewicz Mar 06 '13 at 15:24
possible duplicate of [How can I create cartesian product of vector of vectors?](http://stackoverflow.com/questions/5279051/how-can-i-create-cartesian-product-of-vector-of-vectors) – interjay Mar 06 '13 at 15:27
Look at this http://stackoverflow.com/questions/5279051/how-can-i-create-cartesian-product-of-vector-of-vectors – Krish Mar 06 '13 at 18:29

get all combinations between set elements

0 Answers0