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 sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
