> 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 ?
>
It is indeed redundent. I did search for a SearchGraph implementation in
Sage. I saw the comment See also "GenericBacktr
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 inpu
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
On Sat, Oct 13, 2012 at 07:09:33AM +, Simon King wrote:
> By the way, did you think about a construction functor for the new
> parents? If I understand correctly, you have some algorithmic procedure
> A that you apply to some basic data (a root) R. Hence, it would not be
> totally absurd to hav
On Wed, Oct 10, 2012 at 09:18:58AM -0500, Jason Grout wrote:
> On 10/10/12 8:53 AM, Simon King wrote:
> >And what you tell about the role of "post_process" makes me think it could be
> >renamed into "branch_cut".
>
> Or it could renamed "visit" or "trim" or even just "callback"
Hmm, it could inde
Le 10/10/2012 15:53, Simon King a écrit :
Why not "RecursiveSet"? The word "Generated" seems redundant to me.
And what you tell about the role of "post_process" makes me think it could be
renamed into "branch_cut".
Best regards,
Simon
Hello,
The post_process hardly depend on a fonction (plac
