[gecode-users] Graph matching

[hamza bouchaour]

hi every one,

 

i tring to implement a simple algorithme of matching graph, i've done the data structure (i represent the graphes by an adjacency list: i've an array of nodes). my algorithme consist de verify for each node of G1 if there are any nodes in G2 such these two nodes have the same degree.

 

i've two questions:

1-how can i represent this by a constraint in gecode.

2-also i ask if someone had some details about cp graph, i saw this http://cpgraph.info.ucl.ac.be/cpgraph/doc/group__Examples.html but it's not very claer. thank you

_________________________________________________________________
Découvrez Windows Live Spaces et créez votre site Web perso en quelques clics !
http://spaces.live.com/signup.aspx
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20090627/ba4ebad0/attachment.htm>