Hi, why would you like to know the size of the tree? Implicitly (assuming that all branchings are binary, which they are), the size of the tree is almost known: the number of leaves (failures plus solutions). The only part missing are the open nodes.
Is it really important? It is somewhat easy to add (the only additional information needed is the height of the tree) but for example for comparing models, the number of failures is sufficient. Cheers Christian -- Christian Schulte, http://www.imit.kth.se/~schulte/ -----Original Message----- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Jean-Noël Monette Sent: Thursday, March 29, 2007 5:25 PM To: [EMAIL PROTECTED] Subject: [gecode-users] size of the search tree Hello, Using Gecode, I would like to know what is the size of the search tree but this information is not given. If recomputation is disabled, I think that it can be computed as the sum of the number of clone, the number of fails and the number of solution found. However, when recomputation is activated, there is not a clone for each node of the search tree and I don't see how to recover the size of the tree. Have you any solution? Thanks a lot for your help, Jean-Noël Monette _______________________________________________ Gecode users mailing list [EMAIL PROTECTED] https://www.gecode.org/mailman/listinfo/gecode-users _______________________________________________ Gecode users mailing list [EMAIL PROTECTED] https://www.gecode.org/mailman/listinfo/gecode-users
