diff --git a/PackageInfo.g b/PackageInfo.g index a386c0c6c..ea0a65f1e 100644 --- a/PackageInfo.g +++ b/PackageInfo.g @@ -9,14 +9,14 @@ ## ## <#GAPDoc Label="PKGVERSIONDATA"> -## +## ## ## ## ## ## ## -## +## ## ## <#/GAPDoc> @@ -28,8 +28,8 @@ _STANDREWSCS := Concatenation(["Jack Cole Building, North Haugh, ", SetPackageInfo(rec( PackageName := "Digraphs", Subtitle := "Graphs, digraphs, and multidigraphs in GAP", -Version := "1.7.0", -Date := "14/02/2024", # dd/mm/yyyy format +Version := "1.7.1", +Date := "19/02/2024", # dd/mm/yyyy format License := "GPL-3.0-or-later", ArchiveFormats := ".tar.gz", @@ -353,7 +353,14 @@ Persons := [ WWWHome := "https://mct25.host.cs.st-andrews.ac.uk", PostalAddress := _STANDREWSCS, Place := "St Andrews", - Institution := "University of St Andrews")], + Institution := "University of St Andrews"), + + rec( + LastName := "Zickgraf", + FirstNames := "Fabian", + IsAuthor := false, + IsMaintainer := false, + Email := "f.zickgraf@dashdos.com")], Status := "deposited", diff --git a/_data/package.yml b/_data/package.yml index 16919672b..64c7e10f6 100644 --- a/_data/package.yml +++ b/_data/package.yml @@ -1,6 +1,6 @@ name: Digraphs -version: 1.7.0 -date: 2024-02-14 +version: 1.7.1 +date: 2024-02-19 description: | Graphs, digraphs, and multidigraphs in GAP @@ -78,6 +78,8 @@ contributors: url: https://mariatsalakou.github.io/ - name: Murray Whyte url: mailto:mw231@st-andrews.ac.uk + - name: Fabian Zickgraf + url: mailto:f.zickgraf@dashdos.com GAP: ">=4.10.0" @@ -98,7 +100,6 @@ suggested-pkgs: url: "http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc" - name: "grape" version: ">=4.8.1" - url: "https://gap-packages.github.io/grape" - name: "nautytracesinterface" version: ">=0.2" @@ -108,7 +109,7 @@ packageinfo: https://digraphs.github.io/Digraphs/PackageInfo.g downloads: - name: .tar.gz - url: https://github.com/digraphs/Digraphs/releases/download/v1.7.0/digraphs-1.7.0.tar.gz + url: https://github.com/digraphs/Digraphs/releases/download/v1.7.1/digraphs-1.7.1.tar.gz abstract: | The Digraphs package is a GAP package for digraphs and multidigraphs. diff --git a/doc/chap0.html b/doc/chap0.html index 14dc6dc68..a7af7fd5a 100644 --- a/doc/chap0.html +++ b/doc/chap0.html @@ -25,7 +25,7 @@

Digraphs

-

Version 1.7.0

+

Version 1.7.1

Jan De Beule diff --git a/doc/chap0.txt b/doc/chap0.txt index 88ff5cfc0..31168d6e3 100644 --- a/doc/chap0.txt +++ b/doc/chap0.txt @@ -3,7 +3,7 @@ Digraphs - Version 1.7.0 + Version 1.7.1 Jan De Beule diff --git a/doc/chap0_mj.html b/doc/chap0_mj.html index cafee44cf..9ed62a0e9 100644 --- a/doc/chap0_mj.html +++ b/doc/chap0_mj.html @@ -28,7 +28,7 @@

Digraphs

-

Version 1.7.0

+

Version 1.7.1

Jan De Beule diff --git a/doc/chap1.html b/doc/chap1.html index b31303874..82fe05b46 100644 --- a/doc/chap1.html +++ b/doc/chap1.html @@ -42,7 +42,7 @@

1

1.1 Introduction

-

This is the manual for version 1.7.0 of the Digraphs package. This package was developed at the University of St Andrews by:

+

This is the manual for version 1.7.1 of the Digraphs package. This package was developed at the University of St Andrews by:

    @@ -123,7 +123,7 @@

    1.1 Introduction

    The edge-addition-planarity-suite is also included in Digraphs; see [BM04], [Boy06], [BM06], and [Boy12] . The edge-addition-planarity-suite is an open-source implementation of the edge addition planar graph embedding algorithm and related algorithms by John M. Boyer. See Section 6.7 for more details.

    -

    From version 1.0.0 of this package, digraphs can be either mutable or immutable. Mutable digraphs can be changed in-place by many of the methods in the package, which avoids unnecessary copying. Immutable digraphs cannot be changed in-place, but their advantage is that the value of an attribute of an immutable digraph is only ever computed once. Mutable digraphs can be converted into immutable digraphs in-place using MakeImmutable (Reference: MakeImmutable). One of the motivations for introducing mutable digraphs in version 1.0.0 was that in practice the authors often wanted to create a digraph and immediately modify it (removing certain edges, loops, and so on). Before version 1.0.0, this involved copying the digraph several times, with each copy being discarded almost immediately. From version 1.0.0, this unnecessary copying can be eliminated by first creating a mutable digraph, then changing it in-place, and finally converting the mutable digraph to an immutable one in-place (if desirable).

    +

    From version 1.0.0 of this package, digraphs can be either mutable or immutable. Mutable digraphs can be changed in-place by many of the methods in the package, which avoids unnecessary copying. Immutable digraphs cannot be changed in-place, but their advantage is that the value of an attribute of an immutable digraph is only ever computed once. Mutable digraphs can be converted into immutable digraphs in-place using MakeImmutable (Reference: MakeImmutable). One of the motivations for introducing mutable digraphs in version 1.0.0 was that in practice the authors often wanted to create a digraph and immediately modify it (removing certain edges, loops, and so on). Before version 1.0.0, this involved copying the digraph several times, with each copy being discarded almost immediately. From version 1.0.0, this unnecessary copying can be eliminated by first creating a mutable digraph, then changing it in-place, and finally converting the mutable digraph to an immutable one in-place (if desirable).

    diff --git a/doc/chap1.txt b/doc/chap1.txt index 8aaac4568..b9b635e0b 100644 --- a/doc/chap1.txt +++ b/doc/chap1.txt @@ -4,7 +4,7 @@ 1.1 Introduction - This is the manual for version 1.7.0 of the Digraphs package. This package + This is the manual for version 1.7.1 of the Digraphs package. This package was developed at the University of St Andrews by:  Jan De Beule, diff --git a/doc/chap1_mj.html b/doc/chap1_mj.html index a40f07ee3..558521d8c 100644 --- a/doc/chap1_mj.html +++ b/doc/chap1_mj.html @@ -45,7 +45,7 @@

    1

    1.1 Introduction

    -

    This is the manual for version 1.7.0 of the Digraphs package. This package was developed at the University of St Andrews by:

    +

    This is the manual for version 1.7.1 of the Digraphs package. This package was developed at the University of St Andrews by:

      diff --git a/doc/chap2.html b/doc/chap2.html index 19f33d50a..2e71094d9 100644 --- a/doc/chap2.html +++ b/doc/chap2.html @@ -80,16 +80,16 @@

      2.1 For those in a hurry

    • This step is optional: certain functions in Digraphs require the NautyTracesInterface package to be available. If you want to make use of these functions, please ensure that the NautyTracesInterface package version 0.2 or higher is available. If NautyTracesInterface is not available, then Digraphs can be used as normal with the exception that functions whose names contain "Nauty" will not work.

      • -

    • download the package archive digraphs-1.7.0.tar.gz from the Digraphs package webpage.

      +

    • download the package archive digraphs-1.7.1.tar.gz from the Digraphs package webpage.

      • -

    • unzip and untar the file, this should create a directory called digraphs-1.7.0.

      +

    • unzip and untar the file, this should create a directory called digraphs-1.7.1.

      • -

    • locate the pkg directory of your GAP directory, which contains the directories lib, doc and so on. Move the directory digraphs-1.7.0 into the pkg directory.

      +

    • locate the pkg directory of your GAP directory, which contains the directories lib, doc and so on. Move the directory digraphs-1.7.1 into the pkg directory.

      • -

    • it is necessary to compile the Digraphs package. Inside the pkg/digraphs-1.7.0 directory, type

      +

    • it is necessary to compile the Digraphs package. Inside the pkg/digraphs-1.7.1 directory, type

      @@ -148,7 +148,7 @@ 
      2.1-1 Configuration options
      
 --without-intrinsics
 do not use compiler intrinsics even if available
 
-
       

      
+

      @@ -185,7 +185,7 @@

      2.3 Compiling the kernel module

      It is not possible to use the Digraphs package without compiling it.

      -

      To compile the kernel component inside the pkg/digraphs-1.7.0 directory, type

      +

      To compile the kernel component inside the pkg/digraphs-1.7.1 directory, type

      diff --git a/doc/chap2.txt b/doc/chap2.txt
index d45216ac2..c777c18ad 100644
--- a/doc/chap2.txt
+++ b/doc/chap2.txt
@@ -39,18 +39,18 @@
         not  available, then Digraphs can be used as normal with the exception
         that functions whose names contain Nauty will not work.
   
-      download  the  package archive digraphs-1.7.0.tar.gz from the Digraphs
+      download  the  package archive digraphs-1.7.1.tar.gz from the Digraphs
         package webpage (https://digraphs.github.io/Digraphs/).
   
       unzip  and  untar  the  file,  this  should  create a directory called
-        digraphs-1.7.0.
+        digraphs-1.7.1.
   
       locate  the  pkg  directory  of your GAP directory, which contains the
-        directories lib, doc and so on. Move the directory digraphs-1.7.0 into
+        directories lib, doc and so on. Move the directory digraphs-1.7.1 into
         the pkg directory.
   
       it   is   necessary  to  compile  the  Digraphs  package.  Inside  the
-        pkg/digraphs-1.7.0 directory, type
+        pkg/digraphs-1.7.1 directory, type
   
         
           ./configure
@@ -119,7 +119,7 @@
   
   It is not possible to use the Digraphs package without compiling it.
   
-  To  compile  the  kernel  component inside the pkg/digraphs-1.7.0 directory,
+  To  compile  the  kernel  component inside the pkg/digraphs-1.7.1 directory,
   type
   
   
diff --git a/doc/chap2_mj.html b/doc/chap2_mj.html
index d18fb41b5..08faf8b2c 100644
--- a/doc/chap2_mj.html
+++ b/doc/chap2_mj.html
@@ -83,16 +83,16 @@ 
      2.1 For those in a hurry
      
 
    • This step is optional: certain functions in Digraphs require the NautyTracesInterface package to be available. If you want to make use of these functions, please ensure that the NautyTracesInterface package version 0.2 or higher is available. If NautyTracesInterface is not available, then Digraphs can be used as normal with the exception that functions whose names contain "Nauty" will not work.
      
 
 
      • 
-
    • download the package archive digraphs-1.7.0.tar.gz from the Digraphs package webpage.
      
+
    • download the package archive digraphs-1.7.1.tar.gz from the Digraphs package webpage.
      
 
 
      • 
-
    • unzip and untar the file, this should create a directory called digraphs-1.7.0.
      
+
    • unzip and untar the file, this should create a directory called digraphs-1.7.1.
      
 
 
      • 
-
    • locate the pkg directory of your GAP directory, which contains the directories lib, doc and so on. Move the directory digraphs-1.7.0 into the pkg directory.
      
+
    • locate the pkg directory of your GAP directory, which contains the directories lib, doc and so on. Move the directory digraphs-1.7.1 into the pkg directory.
      
 
 
      • 
-
    • it is necessary to compile the Digraphs package. Inside the pkg/digraphs-1.7.0 directory, type
      
+
    • it is necessary to compile the Digraphs package. Inside the pkg/digraphs-1.7.1 directory, type
      
 
 
 
      @@ -151,7 +151,7 @@ 
      2.1-1 Configuration options
      
 --without-intrinsics
 do not use compiler intrinsics even if available
 
-
       

      
+
      
 
      
 
 
      
@@ -188,7 +188,7 @@ 
      2.3 Compiling the kernel module
      
 
 
      It is not possible to use the Digraphs package without compiling it.
      
 
-
      To compile the kernel component inside the pkg/digraphs-1.7.0 directory, type
      
+
      To compile the kernel component inside the pkg/digraphs-1.7.1 directory, type
      
 
 
 
      diff --git a/doc/chap3.html b/doc/chap3.html
index e0a830981..4012bc1d8 100644
--- a/doc/chap3.html
+++ b/doc/chap3.html
@@ -181,18 +181,18 @@ 
      3.1-1 IsDigraph
      
 
      3.1-2 IsMutableDigraph
      
 
 
      ‣ IsMutableDigraph( category )
      
-
      IsMutableDigraph is a synonym for IsDigraph (3.1-1) and IsMutable (Reference: IsMutable). A mutable digraph may be changed in-place by methods in the Digraphs package, and is not attribute-storing – see IsAttributeStoringRep (Reference: IsAttributeStoringRep).
      
+
      IsMutableDigraph is a synonym for IsDigraph (3.1-1) and IsMutable (Reference: IsMutable). A mutable digraph may be changed in-place by methods in the Digraphs package, and is not attribute-storing – see IsAttributeStoringRep (Reference: IsAttributeStoringRep).
      
 
-
      A mutable digraph may be converted into an immutable attribute-storing digraph by calling MakeImmutable (Reference: MakeImmutable) on the digraph.
      
+
      A mutable digraph may be converted into an immutable attribute-storing digraph by calling MakeImmutable (Reference: MakeImmutable) on the digraph.
      
 
 
      
 
 
      3.1-3 IsImmutableDigraph
      
 
 
      ‣ IsImmutableDigraph( category )
      
-
      IsImmutableDigraph is a subcategory of IsDigraph (3.1-1). Digraphs that lie in IsImmutableDigraph are immutable and attribute-storing. In particular, they lie in IsAttributeStoringRep (Reference: IsAttributeStoringRep).
      
+
      IsImmutableDigraph is a subcategory of IsDigraph (3.1-1). Digraphs that lie in IsImmutableDigraph are immutable and attribute-storing. In particular, they lie in IsAttributeStoringRep (Reference: IsAttributeStoringRep).
      
 
-
      A mutable digraph may be converted to an immutable digraph that lies in the category IsImmutableDigraph by calling MakeImmutable (Reference: MakeImmutable) on the digraph.
      
+
      A mutable digraph may be converted to an immutable digraph that lies in the category IsImmutableDigraph by calling MakeImmutable (Reference: MakeImmutable) on the digraph.
      
 
 
      The operation DigraphMutableCopy (3.3-1) can be used to construct a mutable copy of an immutable digraph. It is however not possible to convert an immutable digraph into a mutable digraph in-place.
      
 
@@ -528,25 +528,25 @@ 
      3.2-2 AsDigraph
      
 
      
           a transformation
         
      
-
      satisfying IsTransformation (Reference: IsTransformation);
      
+
      satisfying IsTransformation (Reference: IsTransformation);
      
 
 
      
 
      
           a permutation
         
      
-
      satisfying IsPerm (Reference: IsPerm);
      
+
      satisfying IsPerm (Reference: IsPerm);
      
 
 
      
 
      
           a partial perm
         
      
-
      satisfying IsPartialPerm (Reference: IsPartialPerm);
      
+
      satisfying IsPartialPerm (Reference: IsPartialPerm);
      
 
 
      
 
      
           a binary relation
         
      
-
      satisfying IsBinaryRelation (Reference: IsBinaryRelation);
      
+
      satisfying IsBinaryRelation (Reference: IsBinaryRelation);
      
 
 
      
 
diff --git a/doc/chap5.html b/doc/chap5.html
index 4d64a6e4b..7bc0a5a87 100644
--- a/doc/chap5.html
+++ b/doc/chap5.html
@@ -2180,7 +2180,7 @@ 
      5.4-29 IteratorOfPaths
      
 
 
      If digraph is a digraph or a list of adjacencies which defines a digraph - see OutNeighbours (5.2-6) - then this operation returns an iterator of the non-trivial directed paths (or directed cycles, in the case that u = v) in digraph from the vertex u to the vertex v.
      
 
-
      See DigraphPath (5.4-22) for more information about the representation of a directed path or directed cycle which is used, and see Reference: Iterators for more information about iterators. See Section Definitions for the definition of a directed path and a directed cycle.
      
+
      See DigraphPath (5.4-22) for more information about the representation of a directed path or directed cycle which is used, and see Reference: Iterators for more information about iterators. See Section Definitions for the definition of a directed path and a directed cycle.
      
 
 
 
      @@ -2503,11 +2503,11 @@ 
      5.6-1 AsSemigroup
      
 
      ‣ AsMonoid( filt, digraph )( operation )
      
 
      Returns: A semilattice of partial perms.
      
 
-
      The operation AsSemigroup requires that filt be equal to IsPartialPermSemigroup (Reference: IsPartialPermSemigroup). If digraph is a IsJoinSemilatticeDigraph (6.4-3) or IsLatticeDigraph (6.4-3) then AsSemigroup returns a semigroup of partial perms which is isomorphic to the semigroup whose elements are the vertices of digraph with the binary operation PartialOrderDigraphJoinOfVertices (5.3-1). If digraph satisfies IsMeetSemilatticeDigraph (6.4-3) but not IsJoinSemilatticeDigraph (6.4-3) then AsSemigroup returns a semigroup of partial perms which is isomorphic to the semigroup whose elements are the vertices of digraph with the binary operation PartialOrderDigraphMeetOfVertices (5.3-1).
      
+
      The operation AsSemigroup requires that filt be equal to IsPartialPermSemigroup (Reference: IsPartialPermSemigroup). If digraph is a IsJoinSemilatticeDigraph (6.4-3) or IsLatticeDigraph (6.4-3) then AsSemigroup returns a semigroup of partial perms which is isomorphic to the semigroup whose elements are the vertices of digraph with the binary operation PartialOrderDigraphJoinOfVertices (5.3-1). If digraph satisfies IsMeetSemilatticeDigraph (6.4-3) but not IsJoinSemilatticeDigraph (6.4-3) then AsSemigroup returns a semigroup of partial perms which is isomorphic to the semigroup whose elements are the vertices of digraph with the binary operation PartialOrderDigraphMeetOfVertices (5.3-1).
      
 
-
      The operation AsMonoid behaves similarly to AsSemigroup except that filt may also be equal to IsPartialPermMonoid (Reference: IsPartialPermMonoid), digraph must satisfy IsLatticeDigraph (6.4-3), and the output satisfies IsMonoid (Reference: IsMonoid).
      
+
      The operation AsMonoid behaves similarly to AsSemigroup except that filt may also be equal to IsPartialPermMonoid (Reference: IsPartialPermMonoid), digraph must satisfy IsLatticeDigraph (6.4-3), and the output satisfies IsMonoid (Reference: IsMonoid).
      
 
-
      The output of both of these operations is guaranteed to be of minimal degree (see DegreeOfPartialPermSemigroup (Reference: DegreeOfPartialPermSemigroup)). Furthermore the GeneratorsOfSemigroup (Reference: GeneratorsOfSemigroup) of the output is guaranteed to be the unique generating set of minimal size.
      
+
      The output of both of these operations is guaranteed to be of minimal degree (see DegreeOfPartialPermSemigroup (Reference: DegreeOfPartialPermSemigroup)). Furthermore the GeneratorsOfSemigroup (Reference: GeneratorsOfSemigroup) of the output is guaranteed to be the unique generating set of minimal size.
      
 
 
 
      @@ -2535,7 +2535,7 @@ 
      5.6-2 AsSemigroup
      
 
      ‣ AsSemigroup( filt, Y, gps, homs )( operation )
      
 
      Returns: A Clifford semigroup of partial perms.
      
 
-
      The operation AsSemigroup requires that filt be equal to IsPartialPermSemigroup (Reference: IsPartialPermSemigroup). If Y is a IsJoinSemilatticeDigraph (6.4-3) or IsMeetSemilatticeDigraph (6.4-3), gps is a list of groups corresponding to each vertex, and homs is a list containing for each edge (i, j) in the transitive reduction of digraph a triple [i, j, hom] where hom is a group homomorphism from gps[i] to gps[j], and the diagram of homomorphisms commutes, then AsSemigroup returns a semigroup of partial perms which is isomorphic to the strong semilattice of groups S[Y; gps; homs].
      
+
      The operation AsSemigroup requires that filt be equal to IsPartialPermSemigroup (Reference: IsPartialPermSemigroup). If Y is a IsJoinSemilatticeDigraph (6.4-3) or IsMeetSemilatticeDigraph (6.4-3), gps is a list of groups corresponding to each vertex, and homs is a list containing for each edge (i, j) in the transitive reduction of digraph a triple [i, j, hom] where hom is a group homomorphism from gps[i] to gps[j], and the diagram of homomorphisms commutes, then AsSemigroup returns a semigroup of partial perms which is isomorphic to the strong semilattice of groups S[Y; gps; homs].
      
 
 
 
      diff --git a/doc/chap6.html b/doc/chap6.html
index c2e7afa81..0e7c03eb9 100644
--- a/doc/chap6.html
+++ b/doc/chap6.html
@@ -1516,7 +1516,7 @@ 
      6.8-2 IsEdgeTransitive
      
 
      ‣ IsEdgeTransitive( digraph )( property )
      
 
      Returns: true or false.
      
 
-
      If digraph is a digraph without multiple edges, then IsEdgeTransitive returns true if digraph is edge transitive, and false otherwise. A digraph is edge transitive if its automorphism group acts transitively on its edges (via the action OnPairs (Reference: OnPairs)).
      
+
      If digraph is a digraph without multiple edges, then IsEdgeTransitive returns true if digraph is edge transitive, and false otherwise. A digraph is edge transitive if its automorphism group acts transitively on its edges (via the action OnPairs (Reference: OnPairs)).
      
 
 
      If the argument digraph is mutable, then the return value of this property is recomputed every time it is called.
      
 
diff --git a/doc/chap7.html b/doc/chap7.html
index 9d4201785..29a74d665 100644
--- a/doc/chap7.html
+++ b/doc/chap7.html
@@ -218,7 +218,7 @@ 
      7.2-2 AutomorphismGroup
      
 
 
      If digraph is not a multidigraph then the automorphism group is returned as a group of permutations on the set of vertices of digraph.
      
 
-
      If digraph is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of digraph with a group of permutations on the set of edges of digraph. These groups can be accessed using Projection (Reference: Projection for a domain and a positive integer) on the returned group.
      
+
      If digraph is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of digraph with a group of permutations on the set of edges of digraph. These groups can be accessed using Projection (Reference: Projection for a domain and a positive integer) on the returned group.
      
 
 
      By default, the automorphism group is found using bliss by Tommi Junttila and Petteri Kaski. If NautyTracesInterface is available, then nauty by Brendan Mckay and Adolfo Piperno can be used instead; see BlissAutomorphismGroup (7.2-3), NautyAutomorphismGroup (7.2-4), DigraphsUseBliss (7.2-1), and DigraphsUseNauty (7.2-1).
      
 
@@ -303,7 +303,7 @@ 
      7.2-5 AutomorphismGroup
      
 
 
      If digraph is not a multidigraph then the automorphism group is returned as a group of permutations on the set of vertices of digraph.
      
 
-
      If digraph is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of digraph with a group of permutations on the set of edges of digraph. These groups can be accessed using Projection (Reference: Projection for a domain and a positive integer) on the returned group.
      
+
      If digraph is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of digraph with a group of permutations on the set of edges of digraph. These groups can be accessed using Projection (Reference: Projection for a domain and a positive integer) on the returned group.
      
 
 
      By default, the automorphism group is found using bliss by Tommi Junttila and Petteri Kaski. If NautyTracesInterface is available, then nauty by Brendan Mckay and Adolfo Piperno can be used instead; see BlissAutomorphismGroup (7.2-3), NautyAutomorphismGroup (7.2-4), DigraphsUseBliss (7.2-1), and DigraphsUseNauty (7.2-1).
      
 
@@ -349,7 +349,7 @@ 
      7.2-6 AutomorphismGroup
      
 
 
      If digraph is not a multidigraph then the automorphism group is returned as a group of permutations on the set of vertices of digraph.
      
 
-
      If digraph is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of digraph with a group of permutations on the set of edges of digraph. These groups can be accessed using Projection (Reference: Projection for a domain and a positive integer) on the returned group.
      
+
      If digraph is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of digraph with a group of permutations on the set of edges of digraph. These groups can be accessed using Projection (Reference: Projection for a domain and a positive integer) on the returned group.
      
 
 
      By default, the automorphism group is found using bliss by Tommi Junttila and Petteri Kaski. If NautyTracesInterface is available, then nauty by Brendan Mckay and Adolfo Piperno can be used instead; see BlissAutomorphismGroup (7.2-3), NautyAutomorphismGroup (7.2-4), DigraphsUseBliss (7.2-1), and DigraphsUseNauty (7.2-1).
      
 
diff --git a/doc/chap9.html b/doc/chap9.html
index 506f688b8..adec013ef 100644
--- a/doc/chap9.html
+++ b/doc/chap9.html
@@ -82,7 +82,7 @@ 
      9.1-1 Splash
      
 
      directory
      
 
      this should be a string representing the name of the directory in path where you want Splash to do its work. This function will create this directory if does not already exist.
      
 
-
      The default value of this option is "tmp.viz" if the option path is present, and the result of DirectoryTemporary (Reference: DirectoryTemporary) is used otherwise.
      
+
      The default value of this option is "tmp.viz" if the option path is present, and the result of DirectoryTemporary (Reference: DirectoryTemporary) is used otherwise.
      
 
 
      
 
      filename
      
@@ -136,7 +136,7 @@ 
      9.1-2 DotDigraph
      
 
 
      The output is in dot format (also known as GraphViz) format. For details about this file format, and information about how to display or edit this format see https://www.graphviz.org.
      
 
-
      The string returned by DotDigraph or DotVertexLabelledDigraph can be written to a file using the command FileString (GAPDoc: FileString).
      
+
      The string returned by DotDigraph or DotVertexLabelledDigraph can be written to a file using the command FileString (GAPDoc: FileString).
      
 
 
 
      @@ -368,7 +368,7 @@ 
      9.1-3 DotSymmetricDigraph
      
 
 
      The output is in dot format (also known as GraphViz) format. For details about this file format, and information about how to display or edit this format see https://www.graphviz.org.
      
 
-
      The string returned by DotSymmetricDigraph can be written to a file using the command FileString (GAPDoc: FileString).
      
+
      The string returned by DotSymmetricDigraph can be written to a file using the command FileString (GAPDoc: FileString).
      
 
 
 
      @@ -449,7 +449,7 @@ 
      9.1-4 DotPartialOrderDigraph
      
 
 
      The output is in dot format (also known as GraphViz) format. For details about this file format, and information about how to display or edit this format see https://www.graphviz.org.
      
 
-
      The string returned by DotPartialOrderDigraph can be written to a file using the command FileString (GAPDoc: FileString).
      
+
      The string returned by DotPartialOrderDigraph can be written to a file using the command FileString (GAPDoc: FileString).
      
 
 
 
      @@ -473,7 +473,7 @@ 
      9.1-5 DotPreorderDigraph
      
 
 
      The output is in dot format (also known as GraphViz) format. For details about this file format, and information about how to display or edit this format see https://www.graphviz.org.
      
 
-
      The string returned by DotPreorderDigraph can be written to a file using the command FileString (GAPDoc: FileString).
      
+
      The string returned by DotPreorderDigraph can be written to a file using the command FileString (GAPDoc: FileString).
      
 
 
 
      @@ -535,11 +535,11 @@ 
      9.2-1 String
      
 
      ‣ PrintString( digraph )( operation )
      
 
      Returns: A string.
      
 
-
      Returns a string string such that EvalString(string) is equal to digraph, and has the same mutability. See EvalString (Reference: EvalString).
      
+
      Returns a string string such that EvalString(string) is equal to digraph, and has the same mutability. See EvalString (Reference: EvalString).
      
 
 
      The methods installed for String make some attempts to ensure that string has as short a length as possible, but there may exist shorter strings that also evaluate to digraph.
      
 
-
      It is possible that string may contain escaped special characters. To obtain a representation of digraph that can be entered as GAP input, please use Print (Reference: Print). Note that Print for a digraph delegates to PrintString, which delegates to String.
      
+
      It is possible that string may contain escaped special characters. To obtain a representation of digraph that can be entered as GAP input, please use Print (Reference: Print). Note that Print for a digraph delegates to PrintString, which delegates to String.
      
 
 
 
      @@ -818,7 +818,7 @@ 
      9.2-7 IteratorFromDigraphFile
      
 
      ‣ IteratorFromDigraphFile( filename[, decoder] )( function )
      
 
      Returns: An iterator.
      
 
-
      If filename is a string representing the name of a file containing encoded digraphs, then IteratorFromDigraphFile returns an iterator for which the value of NextIterator (Reference: NextIterator) is the next digraph encoded in the file.
      
+
      If filename is a string representing the name of a file containing encoded digraphs, then IteratorFromDigraphFile returns an iterator for which the value of NextIterator (Reference: NextIterator) is the next digraph encoded in the file.
      
 
 
      If the optional argument decoder is specified and is a function which decodes a string into a digraph, then IteratorFromDigraphFile will use decoder to decode the digraphs contained in filename.
      
 
diff --git a/doc/chapA.html b/doc/chapA.html
index ba0aa84ed..87599c72c 100644
--- a/doc/chapA.html
+++ b/doc/chapA.html
@@ -126,7 +126,7 @@ 
      A.1 
 SetDigraphVertexLabels (5.1-10) and SetDigraphVertexLabel (5.1-9)
 Use SetDigraphVertexLabel (5.1-9) to set an individual vertex label and SetDigraphVertexLabels (5.1-10) to set all of the vertex labels.
 
-
       

      
+
      
 
      
 
 
      
@@ -246,7 +246,7 @@ 
      A.2 
 IsCompleteDigraph (6.2-5)
 The Grape function IsCompleteGraph is roughly equivalent to IsCompleteDigraph (6.2-5) except that in Digraphs a complete digraph has no loops.
 
-
       

      
+
      
 
      
 
 
      
@@ -296,7 +296,7 @@ 
      A.3 
 None
 The Grape function VertexTransitiveDRGs has no equivalent function in Digraphs, although this might change in the future.
 
-
       

      
+
      
 
      
 
 
      
@@ -341,7 +341,7 @@ 
      A.4 
 DigraphIndependentSet (8.2-2)
 IndependentSet in Grape is equivalent to DigraphIndependentSet (8.2-2) in Digraphs.
 
-
       

      
+
      
 
      
 
 
      
@@ -426,7 +426,7 @@ 
      A.5 
 None
 There is no analogous function in Digraphs. However, the same results would be possible by calling DigraphCopy (3.3-1) on the digraph to produce a copy gr, and then applying SetDigraphGroup(gr, G).
 
-
       

      
+
      
 
      
 
 
      
@@ -456,7 +456,7 @@ 
      A.6 
 DigraphCliques (8.1-4)
 Much of the functionality of CompleteSubgraphsOfGivenSize in Grape is provided by DigraphCliques (8.1-4) and DigraphMaximalCliques (8.1-4) in Digraphs, except that the functionality relating to vertex weights and partial colourings is not implemented.
 
-
       

      
+
      
 
      
 
 
      
@@ -491,7 +491,7 @@ 
      A.7 
 None
 There is no analogous function in Digraphs, although this feature might be implemented in the future.
 
-
       

      
+
      
 
      
 
 
diff --git a/doc/chapA_mj.html b/doc/chapA_mj.html
index 4d7c73f8e..0c22f5221 100644
--- a/doc/chapA_mj.html
+++ b/doc/chapA_mj.html
@@ -129,7 +129,7 @@ 
      A.1 
 SetDigraphVertexLabels (5.1-10) and SetDigraphVertexLabel (5.1-9)
 Use SetDigraphVertexLabel (5.1-9) to set an individual vertex label and SetDigraphVertexLabels (5.1-10) to set all of the vertex labels.
 
-
       

      
+
      
 
      
 
 
      
@@ -249,7 +249,7 @@ 
      A.2 
 IsCompleteDigraph (6.2-5)
 The Grape function IsCompleteGraph is roughly equivalent to IsCompleteDigraph (6.2-5) except that in Digraphs a complete digraph has no loops.
 
-
       

      
+
      
 
      
 
 
      
@@ -299,7 +299,7 @@ 
      A.3 
 None
 The Grape function VertexTransitiveDRGs has no equivalent function in Digraphs, although this might change in the future.
 
-
       

      
+

      • @@ -344,7 +344,7 @@

      A.4 DigraphIndependentSet (8.2-2) IndependentSet in Grape is equivalent to DigraphIndependentSet (8.2-2) in Digraphs. -

       


      +

      @@ -429,7 +429,7 @@

      A.5 None There is no analogous function in Digraphs. However, the same results would be possible by calling DigraphCopy (3.3-1) on the digraph to produce a copy gr, and then applying SetDigraphGroup(gr, G). -

       


      +

      @@ -459,7 +459,7 @@

      A.6 DigraphCliques (8.1-4) Much of the functionality of CompleteSubgraphsOfGivenSize in Grape is provided by DigraphCliques (8.1-4) and DigraphMaximalCliques (8.1-4) in Digraphs, except that the functionality relating to vertex weights and partial colourings is not implemented. -

       


      +

      @@ -494,7 +494,7 @@

      A.7 None There is no analogous function in Digraphs, although this feature might be implemented in the future. -

       


      +