Hi Peter, > I've never written any ocaml bindings ... Same thing for me ! I want nonetheless learn this technique. A work has be done to help us with <caml/alloc.h, memory, /mlvalues.h>. But I don't now the required amount of study.
> You might also look at saucy if your graphs are sparse. > > http://vlsicad.eecs.umich.edu/BK/SAUCY/ No, I wanted to look at small undirected connected graphs that are rather dense. And maybe could I write a brute force permutation algorithm ( for vertices of same degree ) : possibly enough for few vertices ? However thanks for the link I didn't knew. Regards, Fabrice --------------------------------------- "Travailler plus pour polluer plus." --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "ocaml-developer" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/ocaml-developer?hl=en For other OCaml forums, see http://caml.inria.fr/resources/forums.en.html -~----------~----~----~----~------~----~------~--~---
