[gecode-users] graph matching

[hamza bouchaour]

hi every one,
 
i had post yesterday an e-mail and i got tworelevant answers, i just want to know if there any others idea :
 
like i said before a begginer in programming constraint in gecode, i want to implement an algorithme to detect an isomorphsim in graphs,
 
my algorithme is too simple i work with nodes degrees so if two nodes had the same degree they can be match, i have done the data structure ( isue an adjacency list to representing the graphs)
 
i'm blocking on converting this description to gecode constraint, so if you have any idea or a basic a example i thank you in advance. 
_________________________________________________________________
Vous voulez savoir ce que vous pouvez faire avec le nouveau Windows Live ? Lancez-vous !
http://www.microsoft.com/windows/windowslive/default.aspx
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20090628/967214c4/attachment.htm>