It builds on previous approaches that find the symmetries of a graph — all the ways to generate isomorphic graphs by renaming nodes.

A mathematical structure is a set of isomorphic elements, each of which can be perfectly mapped onto the next.

The groups are then said to be isomorphic, and the correspondence between their operations is spoken of as an isomorphism between the groups.