Hello Hamza,
That cpgraph code has not been updated for a long time. You'd be
better off not bothering with it.
If you want to check out newer code you can have a chat with David
Przybilla.
For the topic of graph matching you could have a look at Stephane
Zampelli's thesis from Louvain.
Best,
--
Greg
Sent from my iPhone
On 27 Jun 2009, at 21:45, hamza bouchaour <hammall...@hotmail.com>
wrote:
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
Tous vos amis discutent sur Messenger, et vous ? Téléchargez Messeng
er, c'est gratuit !
_______________________________________________
Gecode users mailing list
us...@gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
_______________________________________________
Gecode users mailing list
us...@gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
