To follow up, I tried writing something myself and ran into problems: see trac ticket #5283 (and also #5280, maybe). So any advice would be appreciated.
On Feb 15, 7:06 pm, John H Palmieri <[email protected]> wrote: > If I have a poset P, is there a simple way in Sage to get the set of > all maximal chains in P? I don't see anything terribly relevant in > posets.py. I can write some code to do it myself (I was thinking of > some sort of recursion), but if someone else has already done it or > has some good ideas, I would be happy to hear them. > > John --~--~---------~--~----~------------~-------~--~----~ 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-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
