Hi,
Unfortunately not. In case you feel tempted to do a propagator yourself
(starting from what is already in Gecode), the following paper explains how
to do that:
Kathryn Glenn Francis, Peter J. Stuckey: Explaining circuit
propagation. Constraints 19(1): 1-29 (2014)
Cheers
Christian
--
Christian Schulte, www.gecode.org/~schulte
Professor of Computer Science, KTH, cschu...@kth.se
Expert Researcher, SICS, cschu...@sics.se
-----Original Message-----
From: users-boun...@gecode.org [mailto:users-boun...@gecode.org] On Behalf
Of Philippe
Sent: Saturday, November 21, 2015 12:01 PM
To: users@gecode.org
Subject: [gecode-users] Path constraint
Hi all,
The path constraint has described in MPG page 77 does only gives path from
s to e visiting all the nodes. Is there a constraint that gives all the
subpaths, not only the Hamiltonians ?
(I have an adjacency matrux and i need to find all path/subpath from s to e)
Thank you
_______________________________________________
Gecode users mailing list
users@gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
_______________________________________________
Gecode users mailing list
users@gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
