#14411: Disjoint Sets --> iter
---------------------------------------+------------------------------------
Reporter: elixyre | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.10
Component: misc | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers: Travis Scrimshaw
Authors: Jean-Baptiste Priez | Merged in:
Dependencies: | Stopgaps:
---------------------------------------+------------------------------------
Comment (by elixyre):
Hi,
Last time I answered little bit quickly (and my code is false). For me, a
disjoint union is roughly a list of list (set of disjoint sets) with two
particular method `union` and `find`. It seems natural (and consistent
with the representation), if there is a `_getitem_` method that returns
one of these lists. It will be disturbing and irrelevant to have
{{{
__getitem__ = find
}}}
And if you are agree with that my question is : what's the input? An
element in the union of the sets or an indice? I think it could be
interesting to have an element.
(I imagine a disjoint sets on all permutations of size `k`, it seems cool
and agradable to visualize easily the class of a particular permutation)
Thanks,
Jean-Baptiste
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14411#comment:8>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
