This package provides an implementation of the graph backtracking algorithm, as described in the paper Computing canonical images in permutation groups with Graph Backtracking by Christopher Jefferson, Rebecca Waldecker, and Wilf A. Wilson. It extends the BacktrackKit package to support graph backtracking.
This algorithm can be used to perform calculations in permutation groups, such as:
- Group and coset intersection
- Finding canonical images of combinatorial structures in any permutation group
This package is intended for learning and exploring the graph backtracking algorithm. The performance is extremely poor. For a modern, high-performance version of this algorithm, please see the vole package.
GraphBacktracking requires GAP version >= 4.13.0, and recent versions of the following packages (see the PackageInfo.g file for specific versions):
- BacktrackKit
- datastructures
- digraphs
- images
- primgrp
Additionally, the QuickCheck package is required to run all of the tests.
This package is a work in progress, both in terms of code and documentation.
If you have any issues or questions about this package, please post an issue at https://github.com/peal/GraphBacktracking/issues