Haskell Graph Automorphism Library

This is a haskell implementation of Brendan McKay's algorithm for graph canonic labeling and automorphism group. (aka Nauty)

Additionally, the library offers facilities to

Construct sample graphs

Handle permutations of graph elements. (orbits)

Handle partitions of the graph (labeling, refining)

Last modified: Tue Oct 19 16:30:11 CEST 2004