Getting the subsets of a set in Python

by

Look at the powerset() recipe in the itertools docs.

from itertools import chain, combinations

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))

def subsets(s):
    return map(set, powerset(s))

More Related Contents:

  1. How to generate all permutations of a list?
  2. Permutations between two lists of unequal length
  3. Evenly distributing n points on a sphere
  4. What is the best way to get all the divisors of a number?
  5. How did Python implement the built-in function pow()?
  6. Generate all permutations of a list without adjacent equal elements
  7. Algorithm to find which number in a list sum up to a certain number
  8. How do I generate all permutations of a list?
  9. all permutations of a binary sequence x bits long
  10. How to find integer nth roots?
  11. How can I match up permutations of a long list with a shorter list (according to the length of the shorter list)? [duplicate]
  12. counting combinations and permutations efficiently
  13. What happens when start value < end value with range() cmd in Python?
  14. Check if all elements in a list are identical
  15. Pythonic way to check if a list is sorted or not
  16. Python round up integer to next hundred
  17. Base 62 conversion
  18. Maximum sum sublist?
  19. Merging a list of time-range tuples that have overlapping time-ranges
  20. Python Implementations of Packing Algorithm
  21. An iterative algorithm for Fibonacci numbers
  22. Python: max/min builtin functions depend on parameter order
  23. Compute *rolling* maximum drawdown of pandas Series
  24. NumPy: Logarithm with base n
  25. How to split an iterable into two lists with alternating elements
  26. Is there a short-hand for nth root of x in Python?
  27. How to find the overlap between 2 sequences, and return it
  28. Where can I inspect Python’s math functions?
  29. Creating combinations that have no more one intersecting element
  30. Python cos(90) and cos(270) not 0

Leave a Comment