Undistributed Packages
These GAP packages are not distributed with GAP. Some are still in development, some were never meant for wide use, and some authors prefer to publish their packages themselves. We do not test them, so a package here may not work with your version of GAP, or may not install at all.
Installing
You can try to install a package with PackageManager, from the URL of its PackageInfo.g file if the list gives one, or else from its git repository:
LoadPackage("PackageManager");
InstallPackage("https://gap-packages.github.io/quickcheck/PackageInfo.g");
InstallPackage("https://github.com/isadofschi/posets.git");
We have not tried this for the packages listed here, so it may fail; then follow the installation instructions on the package’s homepage or in its repository.
The list
| Package | Description | Links |
|---|---|---|
| BacktrackKit | An extensible, easy to understand backtracking framework | homepage source PackageInfo.g |
| BruhatDecomposition | Computes the Bruhat decomposition of matrices in classical groups | source |
| Char0Gauss | Linear algebra stuff | source |
| COCO2P | GAP-package for the computation with coherent configurations | source |
| CompilerForCAP | Speed up and verify categorical algorithms | homepage source PackageInfo.g |
| CoxIter | Wrapper for the CoxIter program designed to compute invariants of hyperbolic Coxeter groups | source |
| EquiDeg | Equivariant Degree Library (for the book https://doi.org/10.1090/surv/286) | source |
| G2Comp | G2Comp/Equivariant 2-complexes | source |
| glabella | Low level interfaces to graph automorphism and canonical labelling tools | homepage source PackageInfo.g |
| GraphBacktracking | A simple but slow implementation of graph backtracking | homepage source PackageInfo.g |
| GRPS1024 | Library of the groups of order 1024 | homepage source PackageInfo.g |
| GRPS39 | Library of the groups of order 19683 | homepage source PackageInfo.g |
| Homology | Simplicial Homology Computations | homepage |
| IdPGroup | Identification functions for different p-groups | homepage |
| IncidenceStructures | GAP implementation of abstract incidence structures | homepage source PackageInfo.g |
| Itest | An implementation of Barmak and Minian’s I-test | source |
| liebreadth | A GAP package to compute the breadth of a nilpotent Lie algebra | homepage source PackageInfo.g |
| NautyTracesInterface | An interface to nauty | homepage source PackageInfo.g |
| nilcano | A GAP package for solving the conjugacy problem in f.g. nilpotent groups | homepage source PackageInfo.g |
| orders | A GAP package for computations with orders over the p-adic integers | source |
| PAG | A GAP package for constructing combinatorial objects with prescribed automorphism groups | homepage source PackageInfo.g |
| Posets | GAP Package for posets and finite spaces | source |
| quickcheck | A “QuickCheck” library for the GAP language | homepage source PackageInfo.g |
| SmallCancellation | Metric and nonmetric small cancellation conditions | source |
| Vole | Vole organises lengthy explorations: Backtrack search in permutation groups with graphs | homepage source PackageInfo.g |
| WeylModules | Functions for doing computations with Weyl modules in positive characteristic for a simple simply-connected algebraic group | homepage source PackageInfo.g |
| YAGS | YAGS - Yet Another Graph System | homepage source PackageInfo.g |
Adding a package
To add your package or change its entry, edit _data/undistributed_packages.yml and open a pull request, or tell us on the GAP development list. Give the URL of your package’s PackageInfo.g if it publishes one, so that PackageManager can find it. Listing a package here is also a good first step towards submitting it for distribution with GAP.
For tools
The list is also available as JSON at /packages/undistributed.json. As in the package-infos.json of the package distribution, it is an object whose keys are the lowercase package names. Its fields are named as in PackageInfo.g: PackageName, Subtitle, PackageWWWHome, SourceRepository and PackageInfoURL. All but the first two are optional.