Hello, Question about graph constraints: I would like to modify the the TSP example in order to find the solutions where the travelling salesman should not return to its starting point. In other terms, is it possible to use the "circuit" constraint to find an hamiltonian path instead of a circuit ? Does it require to modify the code or is it better to create another subclass of the graph class ?
Thanks for any advice, Serge Lemouton _______________________________________________ Gecode users mailing list [email protected] https://www.gecode.org/mailman/listinfo/gecode-users
