On Tue, 26 Aug 2014, Jori Mantysalo wrote:
Gunnar Brinkmann has made a code for generating posets. I think I'm going to try if I can compile it as a part of Sage.
I got permission from Brinkmann and Brendan McKay to add code to Sage. The code is written in C.
The code is much faster, about one second compared to one day with current Sage.
However, Sage does not give a list of posets, but an iterator over them; hence memory requirements are almost none for code that searches for some kind of posets.
So what should we do with the code? Add something like "algorithm=fast" or "format=iterator" -option to Posets(n)?
-- Jori Mäntysalo -- You received this message because you are subscribed to the Google Groups "sage-devel" 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-devel. For more options, visit https://groups.google.com/d/optout.
