> Basically you would like the iterator to return a linear extension of the > ordering? That might be possible if by considering the poset given by > the partial order. > > Yes, that's right. This is most sensible for total orderings, but for partial orders the iterator could return a non-canonical (and presumably not completely guaranteed) linear extension.
I think that this would be a useful feature, unfortunately, to do it efficiently would probably require separate iterators for each ordering. Throwing efficiency to the wind, you could of course generate any FiniteEnumerateSet component and then sort this using the already implemented comparision methods. Andrew -- 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/-/jRCWedLaWS8J. 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.
