Re: [gecode-users] Graph adjacency constraint

2007-11-09 Thread Christian Schulte
PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Malcolm Ryan Sent: Thursday, November 08, 2007 11:15 PM To: gecode list Subject: Re: [gecode-users] Graph adjacency constraint On 09/11/2007, at 8:36 AM, Christian Schulte wrote: > Please consider the element constraint. I don't see how the

Re: [gecode-users] Graph adjacency constraint

2007-11-08 Thread Malcolm Ryan
On 09/11/2007, at 8:36 AM, Christian Schulte wrote: > Please consider the element constraint. I don't see how the element constraint is applicable in this case. > Unless you want to transform your graph representation to an > adjacency rep > which is obviously more suited to constraint progra

Re: [gecode-users] Graph adjacency constraint

2007-11-08 Thread Christian Schulte
released next Monday. Gecode/J 2.0.0 will follow suit a little later. Christian -Original Message- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Malcolm Ryan Sent: Thursday, November 08, 2007 9:32 PM To: [EMAIL PROTECTED] Subject: [gecode-users] Graph adjacency constraint Hi, I

[gecode-users] Graph adjacency constraint

2007-11-08 Thread Malcolm Ryan
Hi, I have a graph expressed as an adjacency matrix M and I want to constrain IntVars X,Y such that M[X][Y] is true. Is there an easy way to do this in Gecode/J? Malcolm -- Many clever men like you have trusted to civilisation. Many clever Babylonians, many clever Egyptians, Many clever men