combinatorics | Developer FAQs

How to find all partitions of a multiset, where each part has distinct elements?

Let's say we have such an array: myArray = [A, A, B, B, C, C, D, E]I would like to create an algorithm so that it will find all the combinations that add up to the whole array, where none of the elements are repeated.

02月12日发表评论

How to find all partitions of a multiset, where each part has distinct elements?

02月11日发表评论

count number of partitions of a set with n elements into k subsets

This program is for count number of partitions of a set with n elements into k subsets I am confusing here return k*countP(n-1, k) + countP(n-1, k-1); can some one explain what is happening here? why we are multiplying with k?

12月20日发表评论

Picking unordered combinations from pools with overlap

I have pools of values and I would like to generate every possible unordered combination by picking from certain pools.

08月19日发表评论

What is the more elegant way of finding combinations in a list?

I came up with this algorithm to find triplets of pairs (I call them trairs), the criteria is that all 3 elements (coins), and only the 3, must be present in all 3 pairs.

07月05日发表评论

Find most efficient groups of pairs

I have a group of people, and I want each person to have a 1:1 meeting with every other person in the group. A given person can only meet with one other person at a time, so I want to do the following:

07月01日发表评论

Python Numpy vectorize nested for-loops for combinatorics

Given an nxn array A of real positive numbers, I'm trying to find the minimum of the maximum of the element-wise minimum of all combinations of three rows of the 2-d array. Using for-loops, that comes out to something like this:

04月26日发表评论