 hgal1.0.1: library for computation automorphism group and canonical labelling of a graph  Contents  Index 





Description 
This modules manages permutations between nodes of a graph. Permutations are represented as arrays.


Synopsis 



Documentation 

type Permutation = Array Vertex Vertex 
A permutations maps a range of Vertices to itself.


fixed :: Permutation > [Vertex] 
Fixed vertices of a given permutation


permBetween :: Bounds > [Vertex] > [Vertex] > Permutation 
Builds the permutation taking l1 on l2.


applyPerm :: Permutation > Graph > Graph 
Relabel a graph using a permutation


orbitsFromPerm :: Permutation > Partition 
Returns the orbits of a permutation, as a partition


mergePerms :: Permutation > Permutation > Permutation 
Merge the orbits of two permutations


Produced by Haddock version 0.8 