Hey Vincent, I found this ticket #5039<http://trac.sagemath.org/sage_trac/ticket/5039> in which it mentions in the combinat queue (although it seems like it got integrated into sage at some point...), they created the data structure known as a disjoint set. From my understanding (a quick browse of source code), the SetPartitions is the list of all set partitions of a given set, whereas DisjointSet is a data structure which focuses on merging of its sets and getting representatives from each set (see disjoint set's wikipedia page <http://en.wikipedia.org/wiki/Disjoint_set_data_structure>). However, this needs a different name; perhaps UnionFindSet or FindMergeSet? Hope that clarifies things.
Best, Travis On Wednesday, December 5, 2012 8:44:23 AM UTC-8, Vincent Delecroix wrote: > > Hello, > > I do not understand the purpose of sage.sets.disjoint_set (which > moreover has nothing to do with disjoint set) ! As far as I understand > it is a duplicate of set partitions with some special features. Am I > right ? > > Best, > Vincent > -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To view this discussion on the web visit https://groups.google.com/d/msg/sage-combinat-devel/-/qFWLQXLHdHEJ. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
