Data.Graph.Permutation

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

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