[gecode-users] Graph adjacency constraint

[Christian Schulte]

Please consider the element constraint. Other options are extensional table
constraints, which will be available in Gecode 2.0.0.

Unless you want to transform your graph representation to an adjacency rep
which is obviously more suited to constraint programming.

BTW, Gecode 2.0.0 will be released next Monday. Gecode/J 2.0.0 will follow
suit a little later.

Christian

-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Malcolm Ryan
Sent: Thursday, November 08, 2007 9:32 PM
To: users at gecode.org
Subject: [gecode-users] Graph adjacency constraint

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 at the end of Rome.
                               - G.K.Chesterton, The Napoleon of  
Notting Hill




_______________________________________________
Gecode users mailing list
users at gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users