# Data structures¶

This module implements basic data structures essential to the rest of the partn_ref module.

REFERENCES:

[1] McKay, Brendan D. Practical Graph Isomorphism. Congressus Numerantium,
Vol. 30 (1981), pp. 45-87.
[2] Fredman, M. and Saks, M. The cell probe complexity of dynamic data
structures. Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 345–354. May 1989.
[3] Seress, Akos. Permutation Group Algorithms. Cambridge University Press,
sage.groups.perm_gps.partn_ref.data_structures.OP_represent(n, merges, perm)

Demonstration and testing.

sage.groups.perm_gps.partn_ref.data_structures.PS_represent(partition, splits)

Demonstration and testing.

sage.groups.perm_gps.partn_ref.data_structures.SC_test_list_perms(L, n, limit, gap, limit_complain, test_contains)

Test that the permutation group generated by list perms in L of degree n is of the correct order, by comparing with GAP. Don’t test if the group is of size greater than limit.