[Nauty-list] Understanding Nauty
Brendan McKay
bdm at cs.anu.edu.au
Tue Nov 28 20:16:10 EST 2006
I don't know of any Java implementation of nauty and agree it would
not be so easy. One thing to consider is some type of automatic
converter. I see a few mentioned on the web:
http://www.soften.ktu.lt/~stonis/c2java/
http://www.jazillian.com/
http://freshmeat.net/projects/c2java/
http://tech.novosoft-us.com/product_c2j.jsp
There are also programs that compile C into Java bytecode:
http://www.axiomsol.com/pro_serv/compiler.php
I have no idea if any of these would be up to the task.
Brendan.
* Sandor Murakozi <smurakozi+nauty at gmail.com> [061128 19:28]:
> Hi,
>
> In my java project I need to find the canonical form of directed
> graphs. As my target platform is not fixed I can't use the nauty lib
> (e.g. via JNI).
> I did some search on the web and this mailing list, but it seems to me
> that no one has ever implemented nauty in java, so I decided that I
> will try.
> I know it won't be an easy task, but hopefully I won't need a full
> implementation, at least not in the first iteration: my graphs are
> usually quite small (less then fifty vertices), so I think I can skip
> some of the more sophisticated tricks and can implement a bit
> simplified version first.
> I've tried to understand the papers provided by Brendan, but it is not
> that easy reading for me :-)
> My question is if someone has a bit higher level description of the
> algorithm (just to help me to understand the more heavyweight stuff)?
> I found several references to a file "Isomorphism.pdf" by Noah
> Giansiracusa, but unfortunately the file is not available on the given
> URL.
> Do any of you have this file (and willing to share it with me)?
>
> Thanks in advance,
> don
> _______________________________________________
> Nauty-list mailing list
> Nauty-list at cs.anu.edu.au
> http://dcsmail.anu.edu.au/cgi-bin/mailman/listinfo/nauty-list
More information about the Nauty
mailing list