


Description 
NOTE: Usage of implicit automorphisms, as described on page 62, is not implemented here.
TODO:
 as GHC 6.6, use Sequence instead of appends at end.
 skip first automorphism found; it is identity.
 try not relabeling the graphs


Synopsis 



Documentation 


Return the canonic version of a graph.



Returns a canonic labeling of the graph (slow  but dead simple implementation).
This implementation serves documentation and debugging purposes.



Returns generators of the automorphism group



Given a graph, return generators of its automorphism group, and its canonic labeling



Tells whether two graphs are isomorphic




Produced by Haddock version 2.3.0 