Hi,
In Gecode, copy doesn't happen for every branching of the search tree,
and whenever a failure happens it just backtracks to a node between the
current failure node and the previous copied node. If a propagator
works dependent on some data structure, and the backtrack jumps to a
node that is not copied, then the data structure should be recomputed.
My question is how to maintain the data structure incrementally for the
propagator? Is there an easy setting to make Gecode copy at each
branching, so that a simple undo policy can be used to maintain the data
structure?
Best regards,
Jun
_______________________________________________
Gecode users mailing list
users@gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
