On Mon, Oct 15, 2012 at 02:51:11PM -0700, Sébastien Labbé wrote: > Hi, > > I really like SearchForest and have been using it some times. But, other > times, my children rules are such that two disctinct branches overlap. So, > just last weekend, I coded a similar SearchGraph class taking as input a > set of roots and a children rule where an element can be obtained in a non > unique path. The difference with SearchForest is that it returns an > iterator over all distinct elements (it remembers if an element as been > reached already).
It seems that your SearchGraph is what is already implemented under TransitiveIdeal in the same file than SearchForest... Can you check if it is redundant ? Cheers, Florent -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To post to this group, send email to sage-devel@googlegroups.com. To unsubscribe from this group, send email to sage-devel+unsubscr...@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel?hl=en.
