[Python] set intersection / itertools combinations...

[uiron]

there's no easy answer to this. consider you have objects O1, O2, O3, O4 and properties P1, P2, P3, P4, grouped like that:

P1: O1, O2, O3
P2: O2, O3, 04
P3: O3, O4, O1
P4: O4, O1, O2


how would you group them? there's three equally viable cases:
P1, P2: O2, O3
P3, P4: O1, O4

P1, P3: O1, O3
P2, P4: O2, O4

P1, P4: O1, O2
P2, P3: O3, O4



And i'm not even touching a topic where in some cases you'd have to choose between prioritizing large groups or evenly-sized groups.

[zoharl]

If I understood you correctly, then:

1. Generate the inverse dictionary that would point from a property to a list of objects that has this property.

2. Hold a boolean array (actually a dictionary) on the side, which would have a 'already chosen' flag for each object.

3. To generate a group: Init the array in 2. Then iterate the dictionary from 1, and for each property add one object to the group if it isn't already there according to the flag array of 2. Update array2 accordingly.

In the same spirit you can choose randomly the size of the group (and try to create a group in size as close as possible to it), and you should iterate the properties in an order of some random permutation of them.

[CGTalk Moderation]

This thread has been automatically closed as it remained inactive for 12 months. If you wish to continue the discussion, please create a new thread in the appropriate forum.