Implementation of a graph backtracking algorithm for GAP
This package provides an implementation of the graph backtracking algorithm, as described in the paper "Computing canonical images in permutation groups with Graph Backtracking" [1] 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 [2] package. [1] https://arxiv.org/abs/2209.02534 [2] https://github.com/peal/vole
| Release | Stable | Testing |
|---|---|---|
| Fedora Rawhide | 1.1.0-1.fc46 | - |
| Fedora 45 | - | 1.1.0-1.fc45 |
| Fedora 44 | - | 1.1.0-1.fc44 |
You can contact the maintainers of this package via email at
gap-pkg-graphbacktracking dash maintainers at fedoraproject dot org.