对于笛卡尔积,请检出
itertools.product。
对于幂,该
itertools文档也给我们的食谱:
def powerset(iterable): "powerset([1,2,3]) --> () (1,) (2,) (3,) (1,2) (1,3) (2,3) (1,2,3)" s = list(iterable) return chain.from_iterable(combinations(s, r) for r in range(len(s)+1))
例如:
>>> test = {1, 2, 3}>>> list(powerset(test))[(), (1,), (2,), (3,), (1, 2), (1, 3), (2, 3), (1, 2, 3)]>>> list(product(test, test))[(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)]
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)