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.
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
CI tests the development, latest, and oldest supported GAP versions on Linux,
plus development GAP on Windows, with both normal and OnlyNeeded loading.
The Docs workflow builds the manual and uploads its PDF.
To release, update the version and date in PackageInfo.g, push to master,
then run Actions → Release on master with dry-run selected first.
Inspect the generated archives and manuals, then rerun without dry-run to
publish the GitHub release and update the package website. Existing website
customisations are preserved. Use force only when intentionally replacing
an existing release or bypassing the release-date check.