Brauer-monoid direct implementation.
A degree n diagram is represented by a single vector of length 2n.
The value at position i is the image of point i.

partitioned binary relations stored as maps: integers -> set of integers
e.g. {1 #{1 2}, 2 #{2}}
for degree n, domain is 1..n, codomain is n+1..2n
e.g. degree 3, domain is {1,2,3}, codomain is {4,5,6}

Transformations and permutations simply representated as vectors.

'Native' conjugacy class representative calculation. Transformations are
separated into single point mappings of the form [source image].
A permutation is constructed by finding the minimal relabeling of a
transformation.

Transformations and permutations embedded into partitioned
binary relations.