Ordered Partitions

This section introduces ordered partitions, which are used in both graph isomorphism and partition backtracking. We will give a definition and provide a simple (and inefficient!) implementation of ordered partitions in GAP.

This section is not going to include much in the way of interesting maths, but it will dive into some (hopefully) interesting algorithm details.