#5039: Create a class for SetPartition (with no s)
---------------------------+------------------------------------------------
Reporter: slabbe | Owner: mhansen
Type: enhancement | Status: new
Priority: major | Milestone: sage-combinat
Component: combinatorics | Keywords:
---------------------------+------------------------------------------------
The Elements of `SetPartitions` of a set A are actually Sets of Sets. But
there are specific functionalities I would like for those "Sets of Sets".
For example : merge the classes of a an b and ask what is the representant
of a, where a, b are in A.
Right now, Arnaud Bergeron and I coded and named it as `DisjointSet` and
it is available in the sage-combinat tree. The implementation is inspired
from :
http://en.wikipedia.org/wiki/Disjoint_set_data_structure
See also this thread :
http://groups.google.com/group/sage-combinat-
devel/browse_thread/thread/4b6d5bb2983d81c2/f52adb855eb3b09f?lnk=gst&q=disjoint+set#f52adb855eb3b09f
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5039>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
