Yes, i understand, but this information is given at the end of the process, i need this information during the search. ¿How i can implement a my own search process in Gecode/J? In the DFSSearch defined in java, call the C++ function to do the search process.
¿I need implement all search process, including the stack file? Sorry for my english, i don't speak good. Thanks Ivan 2007/6/7, Guido Tack <[EMAIL PROTECTED]>:
Hi. Ivan Carvajal wrote: Hi, i use Gecode/J and need get information during the search process, this information is: amount propagation, clones, commit, and depth of three. Both DFSSearch and BABSearch have a method "statistics". The returned object contains nearly all the information you require, just have a look at the documentation. The only thing that's missing is the depth of the tree. If you need that, you will have to implement your own search engine that keeps track of this information. Cheers, Guido -- Guido Tack Programming Systems Lab, Saarland University, Germany http://www.ps.uni-sb.de/~tack <http://www.ps.uni-sb.de/%7Etack>
-- ...:::PAU TE AMO:::...
_______________________________________________ Gecode users mailing list [EMAIL PROTECTED] https://www.gecode.org/mailman/listinfo/gecode-users
