Hi -- I just got back to the problem that I would like to have the maximal elements in what is currently called PairwiseCompatibleSubsets (and this is at least the n-th time I am getting back to this). So I wonder if anyone is going to look at this within finite time, or if I should find a solution myself (which seems a little tricky since the iterator comes from SearchForest, for which maximality doesn't necessarily make sense).
Thanks, Christian -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. 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.
