Goto Chapter: Top 1 2 3 4 Ind

[Top of Book] [Contents] [Next Chapter]

GraphBacktracking

A simple but slow implementation of graph backtracking

1.1.0

2 June 2026

Christopher Jefferson
Email: caj21@st-andrews.ac.uk
Homepage: http://caj.host.cs.st-andrews.ac.uk/
Address:
St Andrews
Scotland
UK

Wilf A. Wilson
Email: gap@wilf-wilson.net
Homepage: https://wilf.me

Contents

1.1 What is GraphBacktracking?

1.2 Relationship to BacktrackKit and Vole

2 Executing a search

2.1 Information and diagnostics

2.2 The main search interface

  2.2-1 GB_SimpleSearch
  2.2-2 GB_SimpleSinglePermSearch
  2.2-3 GB_SimpleAllPermSearch

2.3 Inspecting the initial graph stack

2.3-1 GB_CheckInitialGroup
2.3-2 GB_CheckInitialCoset

3.1 The GB Con record

3.2 Group and coset refiners

3.3 Transporter refiners

3.4 Normaliser and group-conjugacy refiners

3.5 Experimental normaliser variants

4 Equitable Graphs

4.1 Making a partition equitable

  4.1-1 GB_MakeEquitableNone
  4.1-2 GB_MakeEquitableWeak
  4.1-3 GB_MakeEquitableStrong
  4.1-4 GB_MakeEquitableFull

[Top of Book] [Contents] [Next Chapter]

Goto Chapter: Top 1 2 3 4 Ind

generated by GAPDoc2HTML