Canonic labeling of graphs

[JP Bernardy]

Hello all,

As an exercise, I've implemented an algorithm for
canonic relabeling of graphs. (Two graphs are
isomorphic
iff they have the same canonic labelling)

The method used is stolen from Brendan McKay,
"Practical graph isomorphism".
http://cs.anu.edu.au/~bdm/nauty/PGI/

In the hope that it is useful to anyone, I attach the
code (for GHC 6). Any remark is welcome.

Cheers!
 --JP.

__________________________________
Do you Yahoo!?
Yahoo! SiteBuilder - Free, easy-to-use web site design software
http://sitebuilder.yahoo.com-------------- next part --------------
A non-text attachment was scrubbed...
Name: Nauty.tar.gz
Type: application/x-gzip
Size: 8179 bytes
Desc: Nauty.tar.gz
Url : http://porky.devel.redhat.com/pipermail/haskell/attachments/20030923/a272840a/Nauty.tar.bin