Ask Your Question
-1

collection of sets

asked 2010-09-17 23:00:14 -0500

sriram gravatar image

updated 2015-01-14 05:06:20 -0500

FrédéricC gravatar image

How to create a collection of sets and how find its subcollections of specified size

ordered pairs for example say a collection of set {[1,2,3],[3,2,4],[1,2,4]} subcollection of size 2 {[1,2,3],[3,2,4]} {[3,2,4],[1,2,3]} {[3,2,4],[1,20,4]} {[1,20,4],[3,2,4]} {[1,2,3],[1,2,4]} {[1,2,4],[1,2,3]}

Is it possible to do this program below without finding all subsets sage: s = set([1,3,"two"]) # make a set from a list of items sage: t = list(subsets(s)); t # this is the list of all subsets of s [[], [1], [3], [1, 3], ['two'], [1, 'two'], [3, 'two'], [1, 3, 'two']]

sage: for x in subsets(s): # subsets(s) is an iterator, so you can loop through it ....: if len(x) == 2: # and extract items of a specified length ....: print x ....:
[1, 3] [1, 'two'] [3, 'two']

edit retag flag offensive close merge delete

1 answer

Sort by » oldest newest most voted
1

answered 2010-09-18 02:37:18 -0500

niles gravatar image

Hi sriram,

I think this question is pretty unreadable to anyone but me; maybe it would be easier to update the other question where you asked the same thing (you will see an "edit" button near the bottom of the question).

edit flag offensive delete link more

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

Stats

Asked: 2010-09-17 23:00:14 -0500

Seen: 175 times

Last updated: Sep 18 '10