python学习小组分组程序_python – 将所有可能的点组合分组,分为m组

这是一个棘手的问题！我实施了一个天真的蛮力解决方案.这可能太慢了,但这是一个起点.

from itertools import combinations, permutations

points = 'ABCDEF'

r = 3

m = len(points) // r

all_combinations = list(combinations(points, m))

group_length = len(all_combinations) // r

assert r * group_length == len(all_combinations)

found = set()

for combinations_permutation in permutations(all_combinations):

groups = [combinations_permutation[group_length * i: group_length * (i + 1)]

for i in range(r)]

transpose = zip(*groups)

# Avoid very similar-looking solutions

canonical = frozenset(map(frozenset, transpose))

if (canonical not in found and

all(len(col) == len(set(col))

for col in (sum(column, ()) for column in transpose))):

found.add(canonical)

for group in groups:

print ', '.join(map(''.join, group))

print '----'

这是输出的开始：

AB, AC, AD, AE, AF

CD, BE, BF, BD, BC

EF, DF, CE, CF, DE

----

AB, AC, AD, AE, AF

CD, BF, BE, BC, BD

EF, DE, CF, DF, CE

----

AB, AC, AD, AE, AF

CE, BD, BE, BF, BC

DF, EF, CF, CD, DE

----

AB, AC, AD, AE, AF

CE, BF, BC, BD, BE

DF, DE, EF, CF, CD