Merge branch 'stable-1.13'

Author: wilfwilson

.github/workflows/ubuntu.yml

@@ -57,44 +57,44 @@ jobs:
         uses: gap-actions/setup-gap@v3
         with:
           gap-version: ${{ matrix.gap-version }}
-      - name: "Install necessary GAP package clones . . ."
+      - name: "Build Digraphs . . ."
+        uses: gap-actions/build-pkg@v2
+      - name: "Clone additional GAP packages . . ."
         if: ${{ matrix.gap-version != 'v4.10' }}
         run: |
           for PKG in ${{ matrix.pkgs-to-clone }}; do
             cd ${GAPROOT}/pkg
             git clone $PKG
           done
-      # Add a special case for GAP v4.10 because it requires checking out a
-      # specific version of the repository (not the default branch).
-      - name: "Install datastructures v0.2.5 for GAP 4.10"
+      # Special case for GAP v4.10 as it requires checking out a non-default ref
+      - name: "Clone datastructures v0.2.5 (GAP 4.10 only) . . ."
         if: ${{ matrix.gap-version == 'v4.10' }}
-        run: |
-            cd ${GAPROOT}/pkg
-            git clone -b v0.2.5 https://github.com/gap-packages/datastructures datastructures
-      - name: "Build additional necessary GAP packages . . ."
+        run: git clone -b v0.2.5 https://github.com/gap-packages/datastructures ${GAPROOT}/pkg/datastructures
+      - name: "Build relevant GAP packages . . ."
         run: |
           cd ${GAPROOT}/pkg
           ../bin/BuildPackages.sh --strict ${{ matrix.pkgs-to-build }}
-      - name: Build Digraphs . . .
-        uses: gap-actions/build-pkg@v2
-      - name: Install digraphs-lib . . .
-        run: git clone https://github.com/digraphs/digraphs-lib.git
-      - name: Run DigraphsTestInstall . . .
+      - name: "Install digraphs-lib . . ."
+        uses: actions/checkout@v5
+        with:
+          repository: digraphs/digraphs-lib
+          path: digraphs-lib
+      - name: "Run DigraphsTestInstall . . ."
         uses: gap-actions/run-pkg-tests@v4
         with:
           testfile: tst/github_actions/install.g
           mode: ${{ matrix.mode }}
-      - name: Run DigraphsTestStandard . . .
+      - name: "Run DigraphsTestStandard . . ."
         uses: gap-actions/run-pkg-tests@v4
         with:
           testfile: tst/github_actions/standard.g
           mode: ${{ matrix.mode }}
-      - name: Run DigraphsTestManualExamples . . .
+      - name: "Run DigraphsTestManualExamples . . ."
         uses: gap-actions/run-pkg-tests@v4
         with:
           testfile: tst/github_actions/examples.g
           mode: ${{ matrix.mode }}
-      - name: Run DigraphsTestExtreme . . .
+      - name: "Run DigraphsTestExtreme . . ."
         uses: gap-actions/run-pkg-tests@v4
         with:
           testfile: tst/github_actions/extreme.g

CHANGELOG.md

@@ -6,11 +6,9 @@ Licensing information can be found in the `LICENSE` file.
 
 ## Version 1.13.1 (released 27/09/2025)
 
-This is a minor release of the Digraphs package, containing one bugfix.
+This is a minor release of the Digraphs package, containing one bugfix:
 
-## What's Changed
-* In [PR #852](https://github.com/digraphs/Digraphs/pull/852), [@wilfwilson](https://github.com/wilfwilson) fixed a bug that could result in an incorrect result being given for the `AutomorphismGroup` for a digraph that was created by the `CompleteBipartiteDigraph` operation.
-    * This bug was reported by [@bojankuzma000](https://github.com/bojankuzma000) in [Issue #850](https://github.com/digraphs/Digraphs/issues/850).
+In [PR #852](https://github.com/digraphs/Digraphs/pull/852), [@wilfwilson](https://github.com/wilfwilson) fixed a bug that could result in an incorrect result being given for the `AutomorphismGroup` of a digraph created by the `CompleteBipartiteDigraph` operation.  This bug was reported by Bojan Kuzma ([@bojankuzma000](https://github.com/bojankuzma000)) in [Issue #850](https://github.com/digraphs/Digraphs/issues/850).
 
 **Full Changelog**: <https://github.com/digraphs/Digraphs/compare/v1.13.0...v1.13.1>
 
@@ -19,7 +17,7 @@ This is a minor release of the Digraphs package, containing one bugfix.
 ## What's Changed
 * [@jengelh](https://github.com/jengelh) added support for version 4 of the [Edge Addition Planarity Suite][] in [PR #766](https://github.com/digraphs/Digraphs/pull/766). Version 4 is now the version that is vendored with the Digraphs package.
 * [@frankiegillis](https://github.com/frankiegillis) improved the performance of `IsTwoEdgeTransitive` in [PR #739](https://github.com/digraphs/Digraphs/pull/739), and added `Is2EdgeTransitive` as a synonym for this property.
-* [Wilf A. Wilson][] restored compatibility with GAP 4.10 in [PR #846](https://github.com/digraphs/Digraphs/pull/846).
+* [@wilfwilson](https://github.com/wilfwilson) restored compatibility with GAP 4.10 in [PR #846](https://github.com/digraphs/Digraphs/pull/846).
 
 ## New Contributors
 * Jan Engelhardt ([@jengelh](https://github.com/jengelh)) made their first contribution in [PR #766](https://github.com/digraphs/Digraphs/pull/766).
@@ -53,36 +51,42 @@ This is a minor release of the Digraphs package, containing various technical ch
 ## Version 1.11.0 (released 28/08/2025)
 
 ## What's Changed
-* Added `IsTwoEdgeTransitive` by [@frankiegillis](https://github.com/frankiegillis) in [PR #733](https://github.com/digraphs/Digraphs/pull/733).
+
+* [@frankiegillis](https://github.com/frankiegillis) added `IsTwoEdgeTransitive` in [PR #733](https://github.com/digraphs/Digraphs/pull/733).
 * [@flsmith](https://github.com/flsmith) made `RandomDigraph` more random in [PR #738](https://github.com/digraphs/Digraphs/pull/738).
-* Added `BurntPancakeGraph` and `BurntPancakeGraph` in [PR #403](https://github.com/digraphs/Digraphs/pull/403).
-* Added a new optional first argument for mutability in `CayleyDigraph` by [@james-d-mitchell](https://github.com/james-d-mitchell) in [PR #403](https://github.com/digraphs/Digraphs/pull/403).
-* Added `MinimalCyclicEdgeCut` by [@MeikeWeiss](https://github.com/MeikeWeiss) in [PR #754](https://github.com/digraphs/Digraphs/pull/754).
-* Added `DigraphAllChordlessCyclesOfMaximalLength` by [@MeikeWeiss](https://github.com/MeikeWeiss) in [PR #754](https://github.com/digraphs/Digraphs/pull/754).
-* Added `DigraphKings` and `DigraphIsKing` by [@hrj4](https://github.com/hrj4) in [PR #521](https://github.com/digraphs/Digraphs/pull/521).
+* [@james-d-mitchell](https://github.com/james-d-mitchell) added `BurntPancakeGraph` and `BurntPancakeGraph` in [PR #403](https://github.com/digraphs/Digraphs/pull/403).
+* [@james-d-mitchell](https://github.com/james-d-mitchell) added a new optional first argument for mutability in `CayleyDigraph` in [PR #403](https://github.com/digraphs/Digraphs/pull/403).
+* [@MeikeWeiss](https://github.com/MeikeWeiss) added `MinimalCyclicEdgeCut` in [PR #754](https://github.com/digraphs/Digraphs/pull/754).
+* [@MeikeWeiss](https://github.com/MeikeWeiss) added `DigraphAllChordlessCyclesOfMaximalLength` in [PR #754](https://github.com/digraphs/Digraphs/pull/754).
+* [@hrj4](https://github.com/hrj4) added `DigraphKings` and `DigraphIsKing` in [PR #521](https://github.com/digraphs/Digraphs/pull/521).
 * [@wilfwilson](https://github.com/wilfwilson) improved `ViewString` for digraphs in [PR #783](https://github.com/digraphs/Digraphs/pull/783).
 * [@EwanGilligan](https://github.com/EwanGilligan) implemented Zykov's and Christofides's algorithms and made them available as options for `ChromaticNumber` in [PR #491](https://github.com/digraphs/Digraphs/pull/491).
 * [@ChrisJefferson](https://github.com/ChrisJefferson) sped up `OnDigraphs` for a digraph and a permutation in [PR #267](https://github.com/digraphs/Digraphs/pull/267).
-* [@pramothragavan](https://github.com/pramothragavan) added dreadnaut support in [PR #651](https://github.com/digraphs/Digraphs/pull/651), along with the functions `DreadnautString`, `DigraphFromDreadnautString`, `DIMACSString`, and `DigraphFromDIMACSString`; and the variables `WholeFileEncoders` and `WholeFileDecoders` and the functions `IsWholeFileEncoder` and `IsWholeFileDecoder`.
 * [@RaiyanC](https://github.com/RaiyanC) added `DigraphMaximumFlow` in [PR #751](https://github.com/digraphs/Digraphs/pull/751).
 * [@RaiyanC](https://github.com/RaiyanC) added `RandomUniqueEdgeWeightedDigraph` [PR #755](https://github.com/digraphs/Digraphs/pull/755).
+* [@pramothragavan](https://github.com/pramothragavan) added dreadnaut support in [PR #651](https://github.com/digraphs/Digraphs/pull/651), along with the variables `WholeFileEncoders` and `WholeFileDecoders`, and the the functions:
+    * `IsWholeFileEncoder`,
+    * `IsWholeFileDecoder`,
+    * `DreadnautString`,
+    * `DigraphFromDreadnautString`,
+    * `DIMACSString`, and
+    * `DigraphFromDIMACSString`.
 
 ## New Contributors
-* [@BaseMax](https://github.com/BaseMax) made their first contribution in [PR #749](https://github.com/digraphs/Digraphs/pull/749).
+* [@hrj4](https://github.com/hrj4) made their first contribution in [PR #521](https://github.com/digraphs/Digraphs/pull/521).
 * [@pramothragavan](https://github.com/pramothragavan) made their first contribution in [PR #651](https://github.com/digraphs/Digraphs/pull/651).
 * [@BlueRidingHood](https://github.com/BlueRidingHood) made their first contribution in [PR #706](https://github.com/digraphs/Digraphs/pull/706).
-* [@hrj4](https://github.com/hrj4) made their first contribution in [PR #521](https://github.com/digraphs/Digraphs/pull/521).
+* [@BaseMax](https://github.com/BaseMax) made their first contribution in [PR #749](https://github.com/digraphs/Digraphs/pull/749).
 
 **Full Changelog**: <https://github.com/digraphs/Digraphs/compare/v1.10.1...v1.11.0>
 
 ## Version 1.10.1 (released 27/08/2025)
 
+This is a minor release containing various small technical adjustments, and the following bugfix and improvement:
+
 ## What's Changed
-* Fixed an bug in `ArticulationPoints` found by [@wilfwilson](https://github.com/wilfwilson)
-[PR #779](https://github.com/digraphs/Digraphs/pull/779).
-* Inclusion of an appendix to the manual that describes the DIMACS format
-[PR #775](https://github.com/digraphs/Digraphs/pull/775).
-* Various other small technical adjustments.
+* [@wilfwilson](https://github.com/wilfwilson) fixed an bug in `ArticulationPoints` in [PR #779](https://github.com/digraphs/Digraphs/pull/779).
+* [@wilfwilson](https://github.com/wilfwilson) added an appendix to the manual that describes the DIMACS format in [PR #775](https://github.com/digraphs/Digraphs/pull/775).
 
 **Full Changelog**: <https://github.com/digraphs/Digraphs/compare/v1.10.0...v1.10.1>
 

doc/index.html

@@ -15,7 +15,7 @@
   <Returns>Nothing.</Returns>
   <Description>
     These functions can be used to specify whether &NAUTY; or &BLISS; should be
-    used by default by &Digraphs;. If &NautyTracesInterface; is not available,
+    used by default by &Digraphs;. If &NAUTYTRACESINTERFACE; is not available,
     then these functions do nothing. Otherwise, by calling
     <C>DigraphsUseNauty</C> subsequent computations will default to using
     &NAUTY; rather than &BLISS;, where possible.
@@ -87,7 +87,7 @@ gap> Size(G);
   <Description>
     If <A>digraph</A> is a digraph, then this attribute contains the group of
     automorphisms of <A>digraph</A> as calculated using &NAUTY; by
-    Brendan Mckay and Adolfo Piperno via &NautyTracesInterface;.
+    Brendan Mckay and Adolfo Piperno via &NAUTYTRACESINTERFACE;.
 
     <!-- FIXME be more explicit about what the second arg is -->
 
@@ -134,7 +134,7 @@ Group([ (3,4)(6,7)(8,9), (2,3)(5,6)(9,10), (2,5)(3,6)(4,7),
     returned group.<P/>
 
     By default, the automorphism group is found using &BLISS; by Tommi Junttila
-    and Petteri Kaski. If &NautyTracesInterface; is available, then &NAUTY; by
+    and Petteri Kaski. If &NAUTYTRACESINTERFACE; is available, then &NAUTY; by
     Brendan Mckay and Adolfo Piperno can be used instead; see
     <Ref Attr="BlissAutomorphismGroup" Label="for a digraph"/>, 
     <Ref Attr="NautyAutomorphismGroup"/>, <Ref Func="DigraphsUseBliss"/>,
@@ -207,7 +207,7 @@ true]]></Example>
     returned group.<P/>
 
     By default, the automorphism group is found using &BLISS; by Tommi Junttila
-    and Petteri Kaski. If &NautyTracesInterface; is available, then &NAUTY; by
+    and Petteri Kaski. If &NAUTYTRACESINTERFACE; is available, then &NAUTY; by
     Brendan Mckay and Adolfo Piperno can be used instead; see
     <Ref Attr="BlissAutomorphismGroup"
       Label="for a digraph and homogeneous list"/>,
@@ -295,7 +295,7 @@ true]]></Example>
     returned group.<P/>
 
     By default, the automorphism group is found using &BLISS; by Tommi Junttila
-    and Petteri Kaski. If &NautyTracesInterface; is available, then &NAUTY; by
+    and Petteri Kaski. If &NAUTYTRACESINTERFACE; is available, then &NAUTY; by
     Brendan Mckay and Adolfo Piperno can be used instead; see
      <Ref Attr="BlissAutomorphismGroup"
        Label="for a digraph, homogeneous list, and list"/>,
@@ -488,7 +488,7 @@ gap> List(DigraphVertices(digraph), i -> colours[i / p]);
 
     By default, an isomorphism is found using the canonical labellings of the
     digraphs obtained from &BLISS; by Tommi Junttila
-    and Petteri Kaski. If &NautyTracesInterface; is available, then &NAUTY; by
+    and Petteri Kaski. If &NAUTYTRACESINTERFACE; is available, then &NAUTY; by
     Brendan Mckay and Adolfo Piperno can be used instead; see
     <Ref Func="DigraphsUseBliss"/>, and <Ref Func="DigraphsUseNauty"/>.
 
@@ -548,7 +548,7 @@ true]]></Example>
 
     By default, an isomorphism is found using the canonical labellings of the
     digraphs obtained from &BLISS; by Tommi Junttila
-    and Petteri Kaski. If &NautyTracesInterface; is available, then &NAUTY; by
+    and Petteri Kaski. If &NAUTYTRACESINTERFACE; is available, then &NAUTY; by
     Brendan Mckay and Adolfo Piperno can be used instead; see
     <Ref Func="DigraphsUseBliss"/>, and <Ref Func="DigraphsUseNauty"/>.
 
@@ -599,7 +599,7 @@ false]]></Example>
 
     By default, an isomorphism is found using the canonical labellings of the
     digraphs obtained from &BLISS; by Tommi Junttila
-    and Petteri Kaski. If &NautyTracesInterface; is available, then &NAUTY; by
+    and Petteri Kaski. If &NAUTYTRACESINTERFACE; is available, then &NAUTY; by
     Brendan Mckay and Adolfo Piperno can be used instead; see
     <Ref Func="DigraphsUseBliss"/>, and <Ref Func="DigraphsUseNauty"/>.
 
@@ -667,7 +667,7 @@ true
 
     By default, an isomorphism is found using the canonical labellings of the
     digraphs obtained from &BLISS; by Tommi Junttila
-    and Petteri Kaski. If &NautyTracesInterface; is available, then &NAUTY; by
+    and Petteri Kaski. If &NAUTYTRACESINTERFACE; is available, then &NAUTY; by
     Brendan Mckay and Adolfo Piperno can be used instead; see
     <Ref Func="DigraphsUseBliss"/>, and <Ref Func="DigraphsUseNauty"/>.
 

doc/isomorph.xml

@@ -64,7 +64,7 @@
     For these tests to complete, the digraphs library <C>digraphs-lib</C> must
     be downloaded and placed in the <C>digraphs</C> directory in a subfolder
     named <F>digraphs-lib</F>.
-    This library can be found on the &Digraphs; website.
+    This library can be found in the &DIGRAPHS_LIB; repository.
   </Description>
 </ManSection>
 <#/GAPDoc>

doc/utils.xml

@@ -33,7 +33,7 @@
   The &BLISS; tool <Cite Key="JK07"/> is included in this package.  It
   is an open-source tool for computing automorphism groups and canonical forms
   of graphs, written by Tommi Junttila and Petteri Kaski. Several of the methods
-  in the &Digraphs; package rely on &BLISS;. If the &NautyTracesInterface;
+  in the &Digraphs; package rely on &BLISS;. If the &NAUTYTRACESINTERFACE;
   package for GAP is available then it is also possible to use &NAUTY; <Cite
     Key="MP14"/> for computing automorphism groups and canonical forms
   in &Digraphs;. See Section 

doc/z-chap0.xml

@@ -45,36 +45,36 @@
 
       <Item>
         <B>This step is optional:</B> certain functions in &Digraphs; require
-          the &NautyTracesInterface; package to be available.
+          the &NAUTYTRACESINTERFACE; package to be available.
         <!-- TODO 
           see Section
         <Ref Subsect="The Grape package"/> for full details.  -->
         If you want to make use of these functions, please ensure that the
-        &NautyTracesInterface; package version &NAUTYTRACESINTERFACEVERS; or
-        higher is available.  If &NautyTracesInterface; is not available,
+        &NAUTYTRACESINTERFACE; package version &NAUTYTRACESINTERFACEVERS; or
+        higher is available.  If &NAUTYTRACESINTERFACE; is not available,
         then &Digraphs; can be used as normal with the exception that 
           functions whose names contain <Q>Nauty</Q> will not work.
       </Item>
 
       <Item>
-        download the package archive <F>&ARCHIVENAME;.tar.gz</F> from
-        <URL Text="the Digraphs package webpage">https://digraphs.github.io/Digraphs/</URL>.
+        download the package archive <F>&ARCHIVENAME;</F> from
+        <URL Text="the Digraphs package webpage">https://digraphs.github.io/Digraphs</URL>.
       </Item>
 
       <Item>
         unzip and untar the file, this should create a directory called
-        <F>&ARCHIVENAME;</F>.
+        <F>&ARCHIVE_BASENAME;</F>.
       </Item>
 
       <Item>
         locate the <F>pkg</F> directory of your &GAP; directory, which contains
         the directories <F>lib</F>, <F>doc</F> and so on. Move the directory
-        <F>&ARCHIVENAME;</F> into the <F>pkg</F> directory.
+        <F>&ARCHIVE_BASENAME;</F> into the <F>pkg</F> directory.
       </Item>
 
       <Item>
         it is necessary to compile the &Digraphs; package.
-        Inside the <F>pkg/&ARCHIVENAME;</F> directory, type
+        Inside the <F>pkg/&ARCHIVE_BASENAME;</F> directory, type
         <Listing>
 <![CDATA[./configure
 make]]></Listing>
@@ -177,7 +177,7 @@ flags are provided.
 
     It is not possible to use the &Digraphs; package without compiling it.<P/>
 
-    To compile the kernel component inside the <F>pkg/&ARCHIVENAME;</F>
+    To compile the kernel component inside the <F>pkg/&ARCHIVE_BASENAME;</F>
     directory, type
 <Listing>
 <![CDATA[

doc/z-chap1.xml

@@ -17,7 +17,7 @@ from} $E_a$ \emph{to} $E_b$. In this case we say that $E_a$ and $E_b$ are
   <Section Label="Isomorphisms and canonical labellings">
     <Heading>Isomorphisms and canonical labellings</Heading>
     From version 0.11.0 of &Digraphs; it is possible to use either &BLISS; or
-    &NAUTY; (via &NautyTracesInterface;) to calculate canonical labellings and
+    &NAUTY; (via &NAUTYTRACESINTERFACE;) to calculate canonical labellings and
     automorphism groups of digraphs; see <Cite Key="JK07"/> and <Cite
       Key="MP14"/> for more details about &BLISS; and &NAUTY;,
     respectively.