Script 'mail_helper' called by obssrc Hello community, here is the log from the commit of package gap-digraphs for openSUSE:Factory checked in at 2024-02-20 21:14:46 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/gap-digraphs (Old) and /work/SRC/openSUSE:Factory/.gap-digraphs.new.1706 (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "gap-digraphs" Tue Feb 20 21:14:46 2024 rev:3 rq:1147672 version:1.7.1 Changes: -------- --- /work/SRC/openSUSE:Factory/gap-digraphs/gap-digraphs.changes 2024-02-14 23:20:21.723764297 +0100 +++ /work/SRC/openSUSE:Factory/.gap-digraphs.new.1706/gap-digraphs.changes 2024-02-20 21:15:00.491322026 +0100 @@ -1,0 +2,7 @@ +Mon Feb 19 21:19:19 UTC 2024 - Jan Engelhardt <[email protected]> + +- Update to release 1.7.1 + * Unspecified changes related to forthcoming changes in the + GAP core. + +------------------------------------------------------------------- Old: ---- digraphs-1.7.0.tar.gz New: ---- digraphs-1.7.1.tar.gz ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ gap-digraphs.spec ++++++ --- /var/tmp/diff_new_pack.NrJD5E/_old 2024-02-20 21:15:01.027342827 +0100 +++ /var/tmp/diff_new_pack.NrJD5E/_new 2024-02-20 21:15:01.027342827 +0100 @@ -17,7 +17,7 @@ Name: gap-digraphs -Version: 1.7.0 +Version: 1.7.1 Release: 0 Summary: GAP: Digraphs and multigraphs License: GPL-3.0-or-later ++++++ digraphs-1.7.0.tar.gz -> digraphs-1.7.1.tar.gz ++++++ ++++ 3448 lines of diff (skipped) ++++ retrying with extended exclude list diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/.VERSION new/digraphs-1.7.1/.VERSION --- old/digraphs-1.7.0/.VERSION 2024-02-14 19:55:39.000000000 +0100 +++ new/digraphs-1.7.1/.VERSION 2024-02-19 20:25:47.000000000 +0100 @@ -1 +1 @@ -1.7.0 +1.7.1 diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/CHANGELOG.md new/digraphs-1.7.1/CHANGELOG.md --- old/digraphs-1.7.0/CHANGELOG.md 2024-02-14 17:54:52.000000000 +0100 +++ new/digraphs-1.7.1/CHANGELOG.md 2024-02-19 18:17:02.000000000 +0100 @@ -1,9 +1,14 @@ # CHANGELOG â Digraphs package for GAP -Copyright © 2014-23 by Jan De Beule, Julius JonuÅ¡as, James D. Mitchell, +Copyright © 2014-24 by Jan De Beule, Julius JonuÅ¡as, James D. Mitchell, Wilf A. Wilson, Michael Young et al. Licensing information can be found in the `LICENSE` file. +## Version 1.7.1 (released 19/02/2024) + +This is a minor release with some changes related to forthcoming changes in +GAP. These changes were implemented by Fabian Zickgraf. + ## Version 1.7.0 (released 14/02/2024) This is a minor release with some new features, and some other improvements in diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/PackageInfo.g new/digraphs-1.7.1/PackageInfo.g --- old/digraphs-1.7.0/PackageInfo.g 2024-02-14 17:54:52.000000000 +0100 +++ new/digraphs-1.7.1/PackageInfo.g 2024-02-19 18:17:02.000000000 +0100 @@ -9,14 +9,14 @@ ## ## <#GAPDoc Label="PKGVERSIONDATA"> -## <!ENTITY VERSION "1.7.0"> +## <!ENTITY VERSION "1.7.1"> ## <!ENTITY GAPVERS "4.10.0"> ## <!ENTITY GRAPEVERS "4.8.1"> ## <!ENTITY IOVERS "4.5.1"> ## <!ENTITY ORBVERS "4.8.2"> ## <!ENTITY DATASTRUCTURESVERS "0.2.5"> ## <!ENTITY NAUTYTRACESINTERFACEVERS "0.2"> -## <!ENTITY ARCHIVENAME "digraphs-1.7.0"> +## <!ENTITY ARCHIVENAME "digraphs-1.7.1"> ## <!ENTITY COPYRIGHTYEARS "2014-24"> ## <#/GAPDoc> @@ -28,8 +28,8 @@ 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 @@ 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 := "[email protected]")], Status := "deposited", diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/VERSIONS new/digraphs-1.7.1/VERSIONS --- old/digraphs-1.7.0/VERSIONS 2024-02-14 17:54:52.000000000 +0100 +++ new/digraphs-1.7.1/VERSIONS 2024-02-19 18:17:02.000000000 +0100 @@ -8,6 +8,7 @@ ############################################################################# ## +release 1.7.1 - 19/02/2024 release 1.7.0 - 14/02/2024 release 1.6.3 - 13/09/2023 release 1.6.2 - 05/04/2023 diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap0.html new/digraphs-1.7.1/doc/chap0.html --- old/digraphs-1.7.0/doc/chap0.html 2024-02-14 19:55:46.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap0.html 2024-02-19 20:25:54.000000000 +0100 @@ -25,7 +25,7 @@ <h1><strong class="pkg">Digraphs</strong></h1> -<p>Version 1.7.0</p> +<p>Version 1.7.1</p> </div> <p><b>Jan De Beule diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap0.txt new/digraphs-1.7.1/doc/chap0.txt --- old/digraphs-1.7.0/doc/chap0.txt 2024-02-14 19:55:40.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap0.txt 2024-02-19 20:25:48.000000000 +0100 @@ -3,7 +3,7 @@ [1X[5XDigraphs[105X[101X - Version 1.7.0 + Version 1.7.1 Jan De Beule diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap0_mj.html new/digraphs-1.7.1/doc/chap0_mj.html --- old/digraphs-1.7.0/doc/chap0_mj.html 2024-02-14 19:55:46.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap0_mj.html 2024-02-19 20:25:54.000000000 +0100 @@ -28,7 +28,7 @@ <h1><strong class="pkg">Digraphs</strong></h1> -<p>Version 1.7.0</p> +<p>Version 1.7.1</p> </div> <p><b>Jan De Beule diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap1.html new/digraphs-1.7.1/doc/chap1.html --- old/digraphs-1.7.0/doc/chap1.html 2024-02-14 19:55:46.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap1.html 2024-02-19 20:25:54.000000000 +0100 @@ -42,7 +42,7 @@ <h4>1.1 <span class="Heading">Introduction</span></h4> -<p>This is the manual for version 1.7.0 of the <strong class="pkg">Digraphs</strong> package. This package was developed at the University of St Andrews by:</p> +<p>This is the manual for version 1.7.1 of the <strong class="pkg">Digraphs</strong> package. This package was developed at the University of St Andrews by:</p> <ul> @@ -123,7 +123,7 @@ <p>The <span class="URL"><a href="https://github.com/graph-algorithms/edge-addition-planarity-suite";>edge-addition-planarity-suite</a></span> is also included in <strong class="pkg">Digraphs</strong>; see <a href="chapBib.html#biBBM04">[BM04]</a>, <a href="chapBib.html#biBB06">[Boy06]</a>, <a href="chapBib.html#biBBM06">[BM06]</a>, and <a href="chapBib.html#biBB12">[Boy12]</a> . The <span class="URL"><a href="https://github.com/graph-algorithms/edge-addition-planarity-suite";>edge-addition-planarity-suite</a></span> is an open-source implementation of the edge addition planar graph embedding algorithm and related algorithms by John M. Boyer. See Section <a href="chap6.html#X7E2305528492DDC0"><span class="RefLink">6.7</span></a> for more details.</p> -<p>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 <code class="func">MakeImmutable</code> (<a href="../../../doc/ref/chap12.html#X80CE136D804097C7"><span class="RefLink">Reference: MakeImmutable</span></a>). 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 m utable digraph, then changing it in-place, and finally converting the mutable digraph to an immutable one in-place (if desirable).</p> +<p>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 <code class="func">MakeImmutable</code> (<a href="../../../doc/ref/chap12_mj.html#X80CE136D804097C7"><span class="RefLink">Reference: MakeImmutable</span></a>). 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).</p> <p><a id="X84541F61810C741D" name="X84541F61810C741D"></a></p> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap1.txt new/digraphs-1.7.1/doc/chap1.txt --- old/digraphs-1.7.0/doc/chap1.txt 2024-02-14 19:55:40.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap1.txt 2024-02-19 20:25:48.000000000 +0100 @@ -4,7 +4,7 @@ [1X1.1 [33X[0;0YIntroduction[133X[101X - [33X[0;0YThis is the manual for version 1.7.0 of the [5XDigraphs[105X package. This package + [33X[0;0YThis is the manual for version 1.7.1 of the [5XDigraphs[105X package. This package was developed at the University of St Andrews by:[133X [30X [33X[0;6YJan De Beule,[133X diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap1_mj.html new/digraphs-1.7.1/doc/chap1_mj.html --- old/digraphs-1.7.0/doc/chap1_mj.html 2024-02-14 19:55:46.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap1_mj.html 2024-02-19 20:25:54.000000000 +0100 @@ -45,7 +45,7 @@ <h4>1.1 <span class="Heading">Introduction</span></h4> -<p>This is the manual for version 1.7.0 of the <strong class="pkg">Digraphs</strong> package. This package was developed at the University of St Andrews by:</p> +<p>This is the manual for version 1.7.1 of the <strong class="pkg">Digraphs</strong> package. This package was developed at the University of St Andrews by:</p> <ul> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap2.html new/digraphs-1.7.1/doc/chap2.html --- old/digraphs-1.7.0/doc/chap2.html 2024-02-14 19:55:46.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap2.html 2024-02-19 20:25:54.000000000 +0100 @@ -80,16 +80,16 @@ <li><p><strong class="button">This step is optional:</strong> certain functions in <strong class="pkg">Digraphs</strong> require the <span class="URL"><a href="https://github.com/gap-packages/NautyTracesInterface";>NautyTracesInterface</a></span> package to be available. If you want to make use of these functions, please ensure that the <span class="URL"><a href="https://github.com/gap-packages/NautyTracesInterface";>NautyTracesInterface</a></span> package version 0.2 or higher is available. If <span class="URL"><a href="https://github.com/gap-packages/NautyTracesInterface";>NautyTracesInterface</a></span> is not available, then <strong class="pkg">Digraphs</strong> can be used as normal with the exception that functions whose names contain "Nauty" will not work.</p> </li> -<li><p>download the package archive <code class="file">digraphs-1.7.0.tar.gz</code> from <span class="URL"><a href="https://digraphs.github.io/Digraphs/";>the Digraphs package webpage</a></span>.</p> +<li><p>download the package archive <code class="file">digraphs-1.7.1.tar.gz</code> from <span class="URL"><a href="https://digraphs.github.io/Digraphs/";>the Digraphs package webpage</a></span>.</p> </li> -<li><p>unzip and untar the file, this should create a directory called <code class="file">digraphs-1.7.0</code>.</p> +<li><p>unzip and untar the file, this should create a directory called <code class="file">digraphs-1.7.1</code>.</p> </li> -<li><p>locate the <code class="file">pkg</code> directory of your <strong class="pkg">GAP</strong> directory, which contains the directories <code class="file">lib</code>, <code class="file">doc</code> and so on. Move the directory <code class="file">digraphs-1.7.0</code> into the <code class="file">pkg</code> directory.</p> +<li><p>locate the <code class="file">pkg</code> directory of your <strong class="pkg">GAP</strong> directory, which contains the directories <code class="file">lib</code>, <code class="file">doc</code> and so on. Move the directory <code class="file">digraphs-1.7.1</code> into the <code class="file">pkg</code> directory.</p> </li> -<li><p>it is necessary to compile the <strong class="pkg">Digraphs</strong> package. Inside the <code class="file">pkg/digraphs-1.7.0</code> directory, type</p> +<li><p>it is necessary to compile the <strong class="pkg">Digraphs</strong> package. Inside the <code class="file">pkg/digraphs-1.7.1</code> directory, type</p> <div class="example"><pre> @@ -148,7 +148,7 @@ <td class="tdleft"><code class="code">--without-intrinsics</code></td> <td class="tdleft">do not use compiler intrinsics even if available</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X780AA9D97EBCA95D" name="X780AA9D97EBCA95D"></a></p> @@ -185,7 +185,7 @@ <p>It is not possible to use the <strong class="pkg">Digraphs</strong> package without compiling it.</p> -<p>To compile the kernel component inside the <code class="file">pkg/digraphs-1.7.0</code> directory, type</p> +<p>To compile the kernel component inside the <code class="file">pkg/digraphs-1.7.1</code> directory, type</p> <div class="example"><pre> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap2.txt new/digraphs-1.7.1/doc/chap2.txt --- old/digraphs-1.7.0/doc/chap2.txt 2024-02-14 19:55:40.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap2.txt 2024-02-19 20:25:48.000000000 +0100 @@ -39,18 +39,18 @@ not available, then [5XDigraphs[105X can be used as normal with the exception that functions whose names contain [21XNauty[121X will not work.[133X - [30X [33X[0;6Ydownload the package archive [11Xdigraphs-1.7.0.tar.gz[111X from the Digraphs + [30X [33X[0;6Ydownload the package archive [11Xdigraphs-1.7.1.tar.gz[111X from the Digraphs package webpage ([7Xhttps://digraphs.github.io/Digraphs/[107X).[133X [30X [33X[0;6Yunzip and untar the file, this should create a directory called - [11Xdigraphs-1.7.0[111X.[133X + [11Xdigraphs-1.7.1[111X.[133X [30X [33X[0;6Ylocate the [11Xpkg[111X directory of your [5XGAP[105X directory, which contains the - directories [11Xlib[111X, [11Xdoc[111X and so on. Move the directory [11Xdigraphs-1.7.0[111X into + directories [11Xlib[111X, [11Xdoc[111X and so on. Move the directory [11Xdigraphs-1.7.1[111X into the [11Xpkg[111X directory.[133X [30X [33X[0;6Yit is necessary to compile the [5XDigraphs[105X package. Inside the - [11Xpkg/digraphs-1.7.0[111X directory, type[133X + [11Xpkg/digraphs-1.7.1[111X directory, type[133X [4X [32X[104X [4X./configure[104X @@ -119,7 +119,7 @@ [33X[0;0YIt is not possible to use the [5XDigraphs[105X package without compiling it.[133X - [33X[0;0YTo compile the kernel component inside the [11Xpkg/digraphs-1.7.0[111X directory, + [33X[0;0YTo compile the kernel component inside the [11Xpkg/digraphs-1.7.1[111X directory, type[133X [4X[32X[104X diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap2_mj.html new/digraphs-1.7.1/doc/chap2_mj.html --- old/digraphs-1.7.0/doc/chap2_mj.html 2024-02-14 19:55:46.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap2_mj.html 2024-02-19 20:25:54.000000000 +0100 @@ -83,16 +83,16 @@ <li><p><strong class="button">This step is optional:</strong> certain functions in <strong class="pkg">Digraphs</strong> require the <span class="URL"><a href="https://github.com/gap-packages/NautyTracesInterface";>NautyTracesInterface</a></span> package to be available. If you want to make use of these functions, please ensure that the <span class="URL"><a href="https://github.com/gap-packages/NautyTracesInterface";>NautyTracesInterface</a></span> package version 0.2 or higher is available. If <span class="URL"><a href="https://github.com/gap-packages/NautyTracesInterface";>NautyTracesInterface</a></span> is not available, then <strong class="pkg">Digraphs</strong> can be used as normal with the exception that functions whose names contain "Nauty" will not work.</p> </li> -<li><p>download the package archive <code class="file">digraphs-1.7.0.tar.gz</code> from <span class="URL"><a href="https://digraphs.github.io/Digraphs/";>the Digraphs package webpage</a></span>.</p> +<li><p>download the package archive <code class="file">digraphs-1.7.1.tar.gz</code> from <span class="URL"><a href="https://digraphs.github.io/Digraphs/";>the Digraphs package webpage</a></span>.</p> </li> -<li><p>unzip and untar the file, this should create a directory called <code class="file">digraphs-1.7.0</code>.</p> +<li><p>unzip and untar the file, this should create a directory called <code class="file">digraphs-1.7.1</code>.</p> </li> -<li><p>locate the <code class="file">pkg</code> directory of your <strong class="pkg">GAP</strong> directory, which contains the directories <code class="file">lib</code>, <code class="file">doc</code> and so on. Move the directory <code class="file">digraphs-1.7.0</code> into the <code class="file">pkg</code> directory.</p> +<li><p>locate the <code class="file">pkg</code> directory of your <strong class="pkg">GAP</strong> directory, which contains the directories <code class="file">lib</code>, <code class="file">doc</code> and so on. Move the directory <code class="file">digraphs-1.7.1</code> into the <code class="file">pkg</code> directory.</p> </li> -<li><p>it is necessary to compile the <strong class="pkg">Digraphs</strong> package. Inside the <code class="file">pkg/digraphs-1.7.0</code> directory, type</p> +<li><p>it is necessary to compile the <strong class="pkg">Digraphs</strong> package. Inside the <code class="file">pkg/digraphs-1.7.1</code> directory, type</p> <div class="example"><pre> @@ -151,7 +151,7 @@ <td class="tdleft"><code class="code">--without-intrinsics</code></td> <td class="tdleft">do not use compiler intrinsics even if available</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X780AA9D97EBCA95D" name="X780AA9D97EBCA95D"></a></p> @@ -188,7 +188,7 @@ <p>It is not possible to use the <strong class="pkg">Digraphs</strong> package without compiling it.</p> -<p>To compile the kernel component inside the <code class="file">pkg/digraphs-1.7.0</code> directory, type</p> +<p>To compile the kernel component inside the <code class="file">pkg/digraphs-1.7.1</code> directory, type</p> <div class="example"><pre> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap3.html new/digraphs-1.7.1/doc/chap3.html --- old/digraphs-1.7.0/doc/chap3.html 2024-02-14 19:55:46.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap3.html 2024-02-19 20:25:54.000000000 +0100 @@ -181,18 +181,18 @@ <h5>3.1-2 IsMutableDigraph</h5> <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsMutableDigraph</code></td><td class="tdright">( category )</td></tr></table></div> -<p><code class="code">IsMutableDigraph</code> is a synonym for <code class="func">IsDigraph</code> (<a href="chap3.html#X7877ADC77F85E630"><span class="RefLink">3.1-1</span></a>) and <code class="func">IsMutable</code> (<a href="../../../doc/ref/chap12.html#X7999AD1D7A4F1F46"><span class="RefLink">Reference: IsMutable</span></a>). A mutable digraph may be changed in-place by methods in the <strong class="pkg">Digraphs</strong> package, and is not attribute-storing â see <code class="func">IsAttributeStoringRep</code> (<a href="../../../doc/ref/chap13.html#X7A951C33839AF2C1"><span class="RefLink">Reference: IsAttributeStoringRep</span></a>).</p> +<p><code class="code">IsMutableDigraph</code> is a synonym for <code class="func">IsDigraph</code> (<a href="chap3.html#X7877ADC77F85E630"><span class="RefLink">3.1-1</span></a>) and <code class="func">IsMutable</code> (<a href="../../../doc/ref/chap12_mj.html#X7999AD1D7A4F1F46"><span class="RefLink">Reference: IsMutable</span></a>). A mutable digraph may be changed in-place by methods in the <strong class="pkg">Digraphs</strong> package, and is not attribute-storing â see <code class="func">IsAttributeStoringRep</code> (<a href="../../../doc/ref/chap13_mj.html#X7A951C33839AF2C1"><span class="RefLink">Reference: IsAttributeStoringRep</span></a>).</p> -<p>A mutable digraph may be converted into an immutable attribute-storing digraph by calling <code class="func">MakeImmutable</code> (<a href="../../../doc/ref/chap12.html#X80CE136D804097C7"><span class="RefLink">Reference: MakeImmutable</span></a>) on the digraph.</p> +<p>A mutable digraph may be converted into an immutable attribute-storing digraph by calling <code class="func">MakeImmutable</code> (<a href="../../../doc/ref/chap12_mj.html#X80CE136D804097C7"><span class="RefLink">Reference: MakeImmutable</span></a>) on the digraph.</p> <p><a id="X7CAFAA89804F80BD" name="X7CAFAA89804F80BD"></a></p> <h5>3.1-3 IsImmutableDigraph</h5> <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsImmutableDigraph</code></td><td class="tdright">( category )</td></tr></table></div> -<p><code class="code">IsImmutableDigraph</code> is a subcategory of <code class="func">IsDigraph</code> (<a href="chap3.html#X7877ADC77F85E630"><span class="RefLink">3.1-1</span></a>). Digraphs that lie in <code class="code">IsImmutableDigraph</code> are immutable and attribute-storing. In particular, they lie in <code class="func">IsAttributeStoringRep</code> (<a href="../../../doc/ref/chap13.html#X7A951C33839AF2C1"><span class="RefLink">Reference: IsAttributeStoringRep</span></a>).</p> +<p><code class="code">IsImmutableDigraph</code> is a subcategory of <code class="func">IsDigraph</code> (<a href="chap3.html#X7877ADC77F85E630"><span class="RefLink">3.1-1</span></a>). Digraphs that lie in <code class="code">IsImmutableDigraph</code> are immutable and attribute-storing. In particular, they lie in <code class="func">IsAttributeStoringRep</code> (<a href="../../../doc/ref/chap13_mj.html#X7A951C33839AF2C1"><span class="RefLink">Reference: IsAttributeStoringRep</span></a>).</p> -<p>A mutable digraph may be converted to an immutable digraph that lies in the category <code class="code">IsImmutableDigraph</code> by calling <code class="func">MakeImmutable</code> (<a href="../../../doc/ref/chap12.html#X80CE136D804097C7"><span class="RefLink">Reference: MakeImmutable</span></a>) on the digraph.</p> +<p>A mutable digraph may be converted to an immutable digraph that lies in the category <code class="code">IsImmutableDigraph</code> by calling <code class="func">MakeImmutable</code> (<a href="../../../doc/ref/chap12_mj.html#X80CE136D804097C7"><span class="RefLink">Reference: MakeImmutable</span></a>) on the digraph.</p> <p>The operation <code class="func">DigraphMutableCopy</code> (<a href="chap3.html#X83D93A8A8251E6F9"><span class="RefLink">3.3-1</span></a>) 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.</p> @@ -528,25 +528,25 @@ <dt><strong class="Mark"> a transformation </strong></dt> -<dd><p>satisfying <code class="func">IsTransformation</code> (<a href="../../../doc/ref/chap53.html#X7B6259467974FB70"><span class="RefLink">Reference: IsTransformation</span></a>);</p> +<dd><p>satisfying <code class="func">IsTransformation</code> (<a href="../../../doc/ref/chap53_mj.html#X7B6259467974FB70"><span class="RefLink">Reference: IsTransformation</span></a>);</p> </dd> <dt><strong class="Mark"> a permutation </strong></dt> -<dd><p>satisfying <code class="func">IsPerm</code> (<a href="../../../doc/ref/chap42.html#X7AA69C6686FC49EA"><span class="RefLink">Reference: IsPerm</span></a>);</p> +<dd><p>satisfying <code class="func">IsPerm</code> (<a href="../../../doc/ref/chap42_mj.html#X7AA69C6686FC49EA"><span class="RefLink">Reference: IsPerm</span></a>);</p> </dd> <dt><strong class="Mark"> a partial perm </strong></dt> -<dd><p>satisfying <code class="func">IsPartialPerm</code> (<a href="../../../doc/ref/chap54.html#X7EECE133792B30FC"><span class="RefLink">Reference: IsPartialPerm</span></a>);</p> +<dd><p>satisfying <code class="func">IsPartialPerm</code> (<a href="../../../doc/ref/chap54_mj.html#X7EECE133792B30FC"><span class="RefLink">Reference: IsPartialPerm</span></a>);</p> </dd> <dt><strong class="Mark"> a binary relation </strong></dt> -<dd><p>satisfying <code class="func">IsBinaryRelation</code> (<a href="../../../doc/ref/chap33.html#X838651287FCCEFD8"><span class="RefLink">Reference: IsBinaryRelation</span></a>);</p> +<dd><p>satisfying <code class="func">IsBinaryRelation</code> (<a href="../../../doc/ref/chap33_mj.html#X838651287FCCEFD8"><span class="RefLink">Reference: IsBinaryRelation</span></a>);</p> </dd> </dl> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap5.html new/digraphs-1.7.1/doc/chap5.html --- old/digraphs-1.7.0/doc/chap5.html 2024-02-14 19:55:47.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap5.html 2024-02-19 20:25:54.000000000 +0100 @@ -2180,7 +2180,7 @@ <p>If <var class="Arg">digraph</var> is a digraph or a list of adjacencies which defines a digraph - see <code class="func">OutNeighbours</code> (<a href="chap5.html#X7E9880767AE68E00"><span class="RefLink">5.2-6</span></a>) - then this operation returns an iterator of the non-trivial directed paths (or directed cycles, in the case that <var class="Arg">u</var> <code class="code">=</code> <var class="Arg">v</var>) in <var class="Arg">digraph</var> from the vertex <var class="Arg">u</var> to the vertex <var class="Arg">v</var>.</p> -<p>See <code class="func">DigraphPath</code> (<a href="chap5.html#X8039170B82A32257"><span class="RefLink">5.4-22</span></a>) for more information about the representation of a directed path or directed cycle which is used, and see <a href="../../../doc/ref/chap30.html#X85A3F00985453F95"><span class="RefLink">Reference: Iterators</span></a> for more information about iterators. See Section <a href="chap1.html#X84541F61810C741D"><span class="RefLink"><span class="Heading">Definitions</span></span></a> for the definition of a directed path and a directed cycle.</p> +<p>See <code class="func">DigraphPath</code> (<a href="chap5.html#X8039170B82A32257"><span class="RefLink">5.4-22</span></a>) for more information about the representation of a directed path or directed cycle which is used, and see <a href="../../../doc/ref/chap30_mj.html#X85A3F00985453F95"><span class="RefLink">Reference: Iterators</span></a> for more information about iterators. See Section <a href="chap1.html#X84541F61810C741D"><span class="RefLink"><span class="Heading">Definitions</span></span></a> for the definition of a directed path and a directed cycle.</p> <div class="example"><pre> @@ -2503,11 +2503,11 @@ <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AsMonoid</code>( <var class="Arg">filt</var>, <var class="Arg">digraph</var> )</td><td class="tdright">( operation )</td></tr></table></div> <p>Returns: A semilattice of partial perms.</p> -<p>The operation <code class="code">AsSemigroup</code> requires that <var class="Arg">filt</var> be equal to <code class="func">IsPartialPermSemigroup</code> (<a href="../../../doc/ref/chap54.html#X7D161674800B50E0"><span class="RefLink">Reference: IsPartialPermSemigroup</span></a>). If <var class="Arg">digraph</var> is a <code class="func">IsJoinSemilatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>) or <code class="func">IsLatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>) then <code class="code">AsSemigroup</code> returns a semigroup of partial perms which is isomorphic to the semigroup whose elements are the vertices of <var class="Arg">digraph</var> with the binary operation <code class="func">PartialOrderDigraphJoinOfVertices</code> (<a href="chap5.html#X7DDB33B686B3A2C6"><span class="RefLink">5.3-1</span></a>). If <var class="Arg">digraph</var> satisfies <code class="func">IsM eetSemilatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>) but not <code class="func">IsJoinSemilatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>) then <code class="code">AsSemigroup</code> returns a semigroup of partial perms which is isomorphic to the semigroup whose elements are the vertices of <var class="Arg">digraph</var> with the binary operation <code class="func">PartialOrderDigraphMeetOfVertices</code> (<a href="chap5.html#X7DDB33B686B3A2C6"><span class="RefLink">5.3-1</span></a>).</p> +<p>The operation <code class="code">AsSemigroup</code> requires that <var class="Arg">filt</var> be equal to <code class="func">IsPartialPermSemigroup</code> (<a href="../../../doc/ref/chap54_mj.html#X7D161674800B50E0"><span class="RefLink">Reference: IsPartialPermSemigroup</span></a>). If <var class="Arg">digraph</var> is a <code class="func">IsJoinSemilatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>) or <code class="func">IsLatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>) then <code class="code">AsSemigroup</code> returns a semigroup of partial perms which is isomorphic to the semigroup whose elements are the vertices of <var class="Arg">digraph</var> with the binary operation <code class="func">PartialOrderDigraphJoinOfVertices</code> (<a href="chap5.html#X7DDB33B686B3A2C6"><span class="RefLink">5.3-1</span></a>). If <var class="Arg">digraph</var> satisfies <code class="func"> IsMeetSemilatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>) but not <code class="func">IsJoinSemilatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>) then <code class="code">AsSemigroup</code> returns a semigroup of partial perms which is isomorphic to the semigroup whose elements are the vertices of <var class="Arg">digraph</var> with the binary operation <code class="func">PartialOrderDigraphMeetOfVertices</code> (<a href="chap5.html#X7DDB33B686B3A2C6"><span class="RefLink">5.3-1</span></a>).</p> -<p>The operation <code class="code">AsMonoid</code> behaves similarly to <code class="code">AsSemigroup</code> except that <var class="Arg">filt</var> may also be equal to <code class="func">IsPartialPermMonoid</code> (<a href="../../../doc/ref/chap54.html#X7D161674800B50E0"><span class="RefLink">Reference: IsPartialPermMonoid</span></a>), <var class="Arg">digraph</var> must satisfy <code class="func">IsLatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>), and the output satisfies <code class="func">IsMonoid</code> (<a href="../../../doc/ref/chap51.html#X861C523483C6248C"><span class="RefLink">Reference: IsMonoid</span></a>).</p> +<p>The operation <code class="code">AsMonoid</code> behaves similarly to <code class="code">AsSemigroup</code> except that <var class="Arg">filt</var> may also be equal to <code class="func">IsPartialPermMonoid</code> (<a href="../../../doc/ref/chap54_mj.html#X7D161674800B50E0"><span class="RefLink">Reference: IsPartialPermMonoid</span></a>), <var class="Arg">digraph</var> must satisfy <code class="func">IsLatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>), and the output satisfies <code class="func">IsMonoid</code> (<a href="../../../doc/ref/chap51_mj.html#X861C523483C6248C"><span class="RefLink">Reference: IsMonoid</span></a>).</p> -<p>The output of both of these operations is guaranteed to be of minimal degree (see <code class="func">DegreeOfPartialPermSemigroup</code> (<a href="../../../doc/ref/chap54.html#X7D7F0BAB82F0D820"><span class="RefLink">Reference: DegreeOfPartialPermSemigroup</span></a>)). Furthermore the <code class="func">GeneratorsOfSemigroup</code> (<a href="../../../doc/ref/chap51.html#X78147A247963F23B"><span class="RefLink">Reference: GeneratorsOfSemigroup</span></a>) of the output is guaranteed to be the unique generating set of minimal size.</p> +<p>The output of both of these operations is guaranteed to be of minimal degree (see <code class="func">DegreeOfPartialPermSemigroup</code> (<a href="../../../doc/ref/chap54_mj.html#X7D7F0BAB82F0D820"><span class="RefLink">Reference: DegreeOfPartialPermSemigroup</span></a>)). Furthermore the <code class="func">GeneratorsOfSemigroup</code> (<a href="../../../doc/ref/chap51_mj.html#X78147A247963F23B"><span class="RefLink">Reference: GeneratorsOfSemigroup</span></a>) of the output is guaranteed to be the unique generating set of minimal size.</p> <div class="example"><pre> @@ -2535,7 +2535,7 @@ <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AsSemigroup</code>( <var class="Arg">filt</var>, <var class="Arg">Y</var>, <var class="Arg">gps</var>, <var class="Arg">homs</var> )</td><td class="tdright">( operation )</td></tr></table></div> <p>Returns: A Clifford semigroup of partial perms.</p> -<p>The operation <code class="code">AsSemigroup</code> requires that <var class="Arg">filt</var> be equal to <code class="func">IsPartialPermSemigroup</code> (<a href="../../../doc/ref/chap54.html#X7D161674800B50E0"><span class="RefLink">Reference: IsPartialPermSemigroup</span></a>). If <var class="Arg">Y</var> is a <code class="func">IsJoinSemilatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>) or <code class="func">IsMeetSemilatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>), <var class="Arg">gps</var> is a list of groups corresponding to each vertex, and <var class="Arg">homs</var> is a list containing for each edge <code class="code">(i, j)</code> in the transitive reduction of <var class="Arg">digraph</var> a triple <code class="code">[i, j, hom]</code> where <code class="code">hom</code> is a group homomorphism from <code class="code">gps[i]</code> to <code class="code">gps[j]< /code>, and the diagram of homomorphisms commutes, then <code class="code">AsSemigroup</code> returns a semigroup of partial perms which is isomorphic to the strong semilattice of groups <span class="SimpleMath">S[Y; gps; homs]</span>.</p> +<p>The operation <code class="code">AsSemigroup</code> requires that <var class="Arg">filt</var> be equal to <code class="func">IsPartialPermSemigroup</code> (<a href="../../../doc/ref/chap54_mj.html#X7D161674800B50E0"><span class="RefLink">Reference: IsPartialPermSemigroup</span></a>). If <var class="Arg">Y</var> is a <code class="func">IsJoinSemilatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>) or <code class="func">IsMeetSemilatticeDigraph</code> (<a href="chap6.html#X78D3E17B7F737516"><span class="RefLink">6.4-3</span></a>), <var class="Arg">gps</var> is a list of groups corresponding to each vertex, and <var class="Arg">homs</var> is a list containing for each edge <code class="code">(i, j)</code> in the transitive reduction of <var class="Arg">digraph</var> a triple <code class="code">[i, j, hom]</code> where <code class="code">hom</code> is a group homomorphism from <code class="code">gps[i]</code> to <code class="code">gps[ j]</code>, and the diagram of homomorphisms commutes, then <code class="code">AsSemigroup</code> returns a semigroup of partial perms which is isomorphic to the strong semilattice of groups <span class="SimpleMath">S[Y; gps; homs]</span>.</p> <div class="example"><pre> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap6.html new/digraphs-1.7.1/doc/chap6.html --- old/digraphs-1.7.0/doc/chap6.html 2024-02-14 19:55:47.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap6.html 2024-02-19 20:25:54.000000000 +0100 @@ -1516,7 +1516,7 @@ <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IsEdgeTransitive</code>( <var class="Arg">digraph</var> )</td><td class="tdright">( property )</td></tr></table></div> <p>Returns: <code class="keyw">true</code> or <code class="keyw">false</code>.</p> -<p>If <var class="Arg">digraph</var> is a digraph without multiple edges, then <code class="code">IsEdgeTransitive</code> returns <code class="keyw">true</code> if <var class="Arg">digraph</var> is edge transitive, and <code class="keyw">false</code> otherwise. A digraph is <em>edge transitive</em> if its automorphism group acts transitively on its edges (via the action <code class="func">OnPairs</code> (<a href="../../../doc/ref/chap41.html#X80DAA1D2855B1456"><span class="RefLink">Reference: OnPairs</span></a>)).</p> +<p>If <var class="Arg">digraph</var> is a digraph without multiple edges, then <code class="code">IsEdgeTransitive</code> returns <code class="keyw">true</code> if <var class="Arg">digraph</var> is edge transitive, and <code class="keyw">false</code> otherwise. A digraph is <em>edge transitive</em> if its automorphism group acts transitively on its edges (via the action <code class="func">OnPairs</code> (<a href="../../../doc/ref/chap41_mj.html#X80DAA1D2855B1456"><span class="RefLink">Reference: OnPairs</span></a>)).</p> <p>If the argument <var class="Arg">digraph</var> is mutable, then the return value of this property is recomputed every time it is called.</p> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap7.html new/digraphs-1.7.1/doc/chap7.html --- old/digraphs-1.7.0/doc/chap7.html 2024-02-14 19:55:47.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap7.html 2024-02-19 20:25:54.000000000 +0100 @@ -218,7 +218,7 @@ <p>If <var class="Arg">digraph</var> is not a multidigraph then the automorphism group is returned as a group of permutations on the set of vertices of <var class="Arg">digraph</var>.</p> -<p>If <var class="Arg">digraph</var> is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of <var class="Arg">digraph</var> with a group of permutations on the set of edges of <var class="Arg">digraph</var>. These groups can be accessed using <code class="func">Projection</code> (<a href="../../../doc/ref/chap32.html#X8769E8DA80BC96C1"><span class="RefLink">Reference: Projection for a domain and a positive integer</span></a>) on the returned group.</p> +<p>If <var class="Arg">digraph</var> is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of <var class="Arg">digraph</var> with a group of permutations on the set of edges of <var class="Arg">digraph</var>. These groups can be accessed using <code class="func">Projection</code> (<a href="../../../doc/ref/chap32_mj.html#X8769E8DA80BC96C1"><span class="RefLink">Reference: Projection for a domain and a positive integer</span></a>) on the returned group.</p> <p>By default, the automorphism group is found using <span class="URL"><a href="http://www.tcs.tkk.fi/Software/bliss/";>bliss</a></span> by Tommi Junttila and Petteri Kaski. If <span class="URL"><a href="https://github.com/gap-packages/NautyTracesInterface";>NautyTracesInterface</a></span> is available, then <span class="URL"><a href="https://pallini.di.uniroma1.it/";>nauty</a></span> by Brendan Mckay and Adolfo Piperno can be used instead; see <code class="func">BlissAutomorphismGroup</code> (<a href="chap7.html#X7E7B0D88865A89F6"><span class="RefLink">7.2-3</span></a>), <code class="func">NautyAutomorphismGroup</code> (<a href="chap7.html#X857758B18144C0CD"><span class="RefLink">7.2-4</span></a>), <code class="func">DigraphsUseBliss</code> (<a href="chap7.html#X83E593F3855B122E"><span class="RefLink">7.2-1</span></a>), and <code class="func">DigraphsUseNauty</code> (<a href="chap7.html#X83E593F3855B122E"><span class="RefLink">7.2-1</span></a>).</p> @@ -303,7 +303,7 @@ <p>If <var class="Arg">digraph</var> is not a multidigraph then the automorphism group is returned as a group of permutations on the set of vertices of <var class="Arg">digraph</var>.</p> -<p>If <var class="Arg">digraph</var> is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of <var class="Arg">digraph</var> with a group of permutations on the set of edges of <var class="Arg">digraph</var>. These groups can be accessed using <code class="func">Projection</code> (<a href="../../../doc/ref/chap32.html#X8769E8DA80BC96C1"><span class="RefLink">Reference: Projection for a domain and a positive integer</span></a>) on the returned group.</p> +<p>If <var class="Arg">digraph</var> is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of <var class="Arg">digraph</var> with a group of permutations on the set of edges of <var class="Arg">digraph</var>. These groups can be accessed using <code class="func">Projection</code> (<a href="../../../doc/ref/chap32_mj.html#X8769E8DA80BC96C1"><span class="RefLink">Reference: Projection for a domain and a positive integer</span></a>) on the returned group.</p> <p>By default, the automorphism group is found using <span class="URL"><a href="http://www.tcs.tkk.fi/Software/bliss/";>bliss</a></span> by Tommi Junttila and Petteri Kaski. If <span class="URL"><a href="https://github.com/gap-packages/NautyTracesInterface";>NautyTracesInterface</a></span> is available, then <span class="URL"><a href="https://pallini.di.uniroma1.it/";>nauty</a></span> by Brendan Mckay and Adolfo Piperno can be used instead; see <code class="func">BlissAutomorphismGroup</code> (<a href="chap7.html#X7E7B0D88865A89F6"><span class="RefLink">7.2-3</span></a>), <code class="func">NautyAutomorphismGroup</code> (<a href="chap7.html#X857758B18144C0CD"><span class="RefLink">7.2-4</span></a>), <code class="func">DigraphsUseBliss</code> (<a href="chap7.html#X83E593F3855B122E"><span class="RefLink">7.2-1</span></a>), and <code class="func">DigraphsUseNauty</code> (<a href="chap7.html#X83E593F3855B122E"><span class="RefLink">7.2-1</span></a>).</p> @@ -349,7 +349,7 @@ <p>If <var class="Arg">digraph</var> is not a multidigraph then the automorphism group is returned as a group of permutations on the set of vertices of <var class="Arg">digraph</var>.</p> -<p>If <var class="Arg">digraph</var> is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of <var class="Arg">digraph</var> with a group of permutations on the set of edges of <var class="Arg">digraph</var>. These groups can be accessed using <code class="func">Projection</code> (<a href="../../../doc/ref/chap32.html#X8769E8DA80BC96C1"><span class="RefLink">Reference: Projection for a domain and a positive integer</span></a>) on the returned group.</p> +<p>If <var class="Arg">digraph</var> is a multidigraph then the automorphism group is returned as the direct product of a group of permutations on the set of vertices of <var class="Arg">digraph</var> with a group of permutations on the set of edges of <var class="Arg">digraph</var>. These groups can be accessed using <code class="func">Projection</code> (<a href="../../../doc/ref/chap32_mj.html#X8769E8DA80BC96C1"><span class="RefLink">Reference: Projection for a domain and a positive integer</span></a>) on the returned group.</p> <p>By default, the automorphism group is found using <span class="URL"><a href="http://www.tcs.tkk.fi/Software/bliss/";>bliss</a></span> by Tommi Junttila and Petteri Kaski. If <span class="URL"><a href="https://github.com/gap-packages/NautyTracesInterface";>NautyTracesInterface</a></span> is available, then <span class="URL"><a href="https://pallini.di.uniroma1.it/";>nauty</a></span> by Brendan Mckay and Adolfo Piperno can be used instead; see <code class="func">BlissAutomorphismGroup</code> (<a href="chap7.html#X7E7B0D88865A89F6"><span class="RefLink">7.2-3</span></a>), <code class="func">NautyAutomorphismGroup</code> (<a href="chap7.html#X857758B18144C0CD"><span class="RefLink">7.2-4</span></a>), <code class="func">DigraphsUseBliss</code> (<a href="chap7.html#X83E593F3855B122E"><span class="RefLink">7.2-1</span></a>), and <code class="func">DigraphsUseNauty</code> (<a href="chap7.html#X83E593F3855B122E"><span class="RefLink">7.2-1</span></a>).</p> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chap9.html new/digraphs-1.7.1/doc/chap9.html --- old/digraphs-1.7.0/doc/chap9.html 2024-02-14 19:55:47.000000000 +0100 +++ new/digraphs-1.7.1/doc/chap9.html 2024-02-19 20:25:54.000000000 +0100 @@ -82,7 +82,7 @@ <dt><strong class="Mark">directory</strong></dt> <dd><p>this should be a string representing the name of the directory in <code class="code">path</code> where you want <code class="code">Splash</code> to do its work. This function will create this directory if does not already exist.</p> -<p>The default value of this option is <code class="code">"tmp.viz"</code> if the option <code class="code">path</code> is present, and the result of <code class="func">DirectoryTemporary</code> (<a href="../../../doc/ref/chap9.html#X8222B1A886E6195E"><span class="RefLink">Reference: DirectoryTemporary</span></a>) is used otherwise.</p> +<p>The default value of this option is <code class="code">"tmp.viz"</code> if the option <code class="code">path</code> is present, and the result of <code class="func">DirectoryTemporary</code> (<a href="../../../doc/ref/chap9_mj.html#X8222B1A886E6195E"><span class="RefLink">Reference: DirectoryTemporary</span></a>) is used otherwise.</p> </dd> <dt><strong class="Mark">filename</strong></dt> @@ -136,7 +136,7 @@ <p>The output is in <code class="code">dot</code> format (also known as <code class="code">GraphViz</code>) format. For details about this file format, and information about how to display or edit this format see <span class="URL"><a href="https://www.graphviz.org";>https://www.graphviz.org</a></span>.</p> -<p>The string returned by <code class="code">DotDigraph</code> or <code class="code">DotVertexLabelledDigraph</code> can be written to a file using the command <code class="func">FileString</code> (<a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/doc/chap6.html#X7E14D32181FBC3C3";><span class="RefLink">GAPDoc: FileString</span></a>).</p> +<p>The string returned by <code class="code">DotDigraph</code> or <code class="code">DotVertexLabelledDigraph</code> can be written to a file using the command <code class="func">FileString</code> (<a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/doc/chap6_mj.html#X7E14D32181FBC3C3";><span class="RefLink">GAPDoc: FileString</span></a>).</p> <div class="example"><pre> @@ -368,7 +368,7 @@ <p>The output is in <code class="code">dot</code> format (also known as <code class="code">GraphViz</code>) format. For details about this file format, and information about how to display or edit this format see <span class="URL"><a href="https://www.graphviz.org";>https://www.graphviz.org</a></span>.</p> -<p>The string returned by <code class="code">DotSymmetricDigraph</code> can be written to a file using the command <code class="func">FileString</code> (<a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/doc/chap6.html#X7E14D32181FBC3C3";><span class="RefLink">GAPDoc: FileString</span></a>).</p> +<p>The string returned by <code class="code">DotSymmetricDigraph</code> can be written to a file using the command <code class="func">FileString</code> (<a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/doc/chap6_mj.html#X7E14D32181FBC3C3";><span class="RefLink">GAPDoc: FileString</span></a>).</p> <div class="example"><pre> @@ -449,7 +449,7 @@ <p>The output is in <code class="code">dot</code> format (also known as <code class="code">GraphViz</code>) format. For details about this file format, and information about how to display or edit this format see <span class="URL"><a href="https://www.graphviz.org";>https://www.graphviz.org</a></span>.</p> -<p>The string returned by <code class="code">DotPartialOrderDigraph</code> can be written to a file using the command <code class="func">FileString</code> (<a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/doc/chap6.html#X7E14D32181FBC3C3";><span class="RefLink">GAPDoc: FileString</span></a>).</p> +<p>The string returned by <code class="code">DotPartialOrderDigraph</code> can be written to a file using the command <code class="func">FileString</code> (<a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/doc/chap6_mj.html#X7E14D32181FBC3C3";><span class="RefLink">GAPDoc: FileString</span></a>).</p> <div class="example"><pre> @@ -473,7 +473,7 @@ <p>The output is in <code class="code">dot</code> format (also known as <code class="code">GraphViz</code>) format. For details about this file format, and information about how to display or edit this format see <span class="URL"><a href="https://www.graphviz.org";>https://www.graphviz.org</a></span>.</p> -<p>The string returned by <code class="code">DotPreorderDigraph</code> can be written to a file using the command <code class="func">FileString</code> (<a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/doc/chap6.html#X7E14D32181FBC3C3";><span class="RefLink">GAPDoc: FileString</span></a>).</p> +<p>The string returned by <code class="code">DotPreorderDigraph</code> can be written to a file using the command <code class="func">FileString</code> (<a href="http://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc/doc/chap6_mj.html#X7E14D32181FBC3C3";><span class="RefLink">GAPDoc: FileString</span></a>).</p> <div class="example"><pre> @@ -535,11 +535,11 @@ <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PrintString</code>( <var class="Arg">digraph</var> )</td><td class="tdright">( operation )</td></tr></table></div> <p>Returns: A string.</p> -<p>Returns a string <code class="code">string</code> such that <code class="code">EvalString(string)</code> is equal to <var class="Arg">digraph</var>, and has the same mutability. See <code class="func">EvalString</code> (<a href="../../../doc/ref/chap27.html#X7DE4CCD285440659"><span class="RefLink">Reference: EvalString</span></a>).</p> +<p>Returns a string <code class="code">string</code> such that <code class="code">EvalString(string)</code> is equal to <var class="Arg">digraph</var>, and has the same mutability. See <code class="func">EvalString</code> (<a href="../../../doc/ref/chap27_mj.html#X7DE4CCD285440659"><span class="RefLink">Reference: EvalString</span></a>).</p> <p>The methods installed for <code class="code">String</code> make some attempts to ensure that <code class="code">string</code> has as short a length as possible, but there may exist shorter strings that also evaluate to <var class="Arg">digraph</var>.</p> -<p>It is possible that <code class="code">string</code> may contain escaped special characters. To obtain a representation of <var class="Arg">digraph</var> that can be entered as GAP input, please use <code class="func">Print</code> (<a href="../../../doc/ref/chap6.html#X7AFA64D97A1F39A3"><span class="RefLink">Reference: Print</span></a>). Note that <code class="code">Print</code> for a digraph delegates to <code class="code">PrintString</code>, which delegates to <code class="code">String</code>.</p> +<p>It is possible that <code class="code">string</code> may contain escaped special characters. To obtain a representation of <var class="Arg">digraph</var> that can be entered as GAP input, please use <code class="func">Print</code> (<a href="../../../doc/ref/chap6_mj.html#X7AFA64D97A1F39A3"><span class="RefLink">Reference: Print</span></a>). Note that <code class="code">Print</code> for a digraph delegates to <code class="code">PrintString</code>, which delegates to <code class="code">String</code>.</p> <div class="example"><pre> @@ -818,7 +818,7 @@ <div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IteratorFromDigraphFile</code>( <var class="Arg">filename</var>[, <var class="Arg">decoder</var>] )</td><td class="tdright">( function )</td></tr></table></div> <p>Returns: An iterator.</p> -<p>If <var class="Arg">filename</var> is a string representing the name of a file containing encoded digraphs, then <code class="code">IteratorFromDigraphFile</code> returns an iterator for which the value of <code class="func">NextIterator</code> (<a href="../../../doc/ref/chap30.html#X879F62F77D1D1179"><span class="RefLink">Reference: NextIterator</span></a>) is the next digraph encoded in the file.</p> +<p>If <var class="Arg">filename</var> is a string representing the name of a file containing encoded digraphs, then <code class="code">IteratorFromDigraphFile</code> returns an iterator for which the value of <code class="func">NextIterator</code> (<a href="../../../doc/ref/chap30_mj.html#X879F62F77D1D1179"><span class="RefLink">Reference: NextIterator</span></a>) is the next digraph encoded in the file.</p> <p>If the optional argument <var class="Arg">decoder</var> is specified and is a function which decodes a string into a digraph, then <code class="code">IteratorFromDigraphFile</code> will use <var class="Arg">decoder</var> to decode the digraphs contained in <var class="Arg">filename</var>.</p> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chapA.html new/digraphs-1.7.1/doc/chapA.html --- old/digraphs-1.7.0/doc/chapA.html 2024-02-14 19:55:47.000000000 +0100 +++ new/digraphs-1.7.1/doc/chapA.html 2024-02-19 20:25:54.000000000 +0100 @@ -126,7 +126,7 @@ <td class="tdleft"><code class="func">SetDigraphVertexLabels</code> (<a href="chap5.html#X7E51F2FE87140B32"><span class="RefLink">5.1-10</span></a>) and <code class="func">SetDigraphVertexLabel</code> (<a href="chap5.html#X7CA91E4B7904F793"><span class="RefLink">5.1-9</span></a>)</td> <td class="tdleft">Use <code class="func">SetDigraphVertexLabel</code> (<a href="chap5.html#X7CA91E4B7904F793"><span class="RefLink">5.1-9</span></a>) to set an individual vertex label and <code class="func">SetDigraphVertexLabels</code> (<a href="chap5.html#X7E51F2FE87140B32"><span class="RefLink">5.1-10</span></a>) to set all of the vertex labels.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X7C38A6397D2770FB" name="X7C38A6397D2770FB"></a></p> @@ -246,7 +246,7 @@ <td class="tdleft"><code class="func">IsCompleteDigraph</code> (<a href="chap6.html#X81F28D4D879FE3B2"><span class="RefLink">6.2-5</span></a>)</td> <td class="tdleft">The <span class="URL"><a href="https://gap-packages.github.io/grape";>Grape</a></span> function <code class="code">IsCompleteGraph</code> is roughly equivalent to <code class="func">IsCompleteDigraph</code> (<a href="chap6.html#X81F28D4D879FE3B2"><span class="RefLink">6.2-5</span></a>) except that in <strong class="pkg">Digraphs</strong> a complete digraph has <em>no loops</em>.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X78A5A34783C70CD7" name="X78A5A34783C70CD7"></a></p> @@ -296,7 +296,7 @@ <td class="tdleft">None</td> <td class="tdleft">The <span class="URL"><a href="https://gap-packages.github.io/grape";>Grape</a></span> function <code class="code">VertexTransitiveDRGs</code> has no equivalent function in <strong class="pkg">Digraphs</strong>, although this might change in the future.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X7C74978D85F7AF5C" name="X7C74978D85F7AF5C"></a></p> @@ -341,7 +341,7 @@ <td class="tdleft"><code class="func">DigraphIndependentSet</code> (<a href="chap8.html#X84350678782BFAB7"><span class="RefLink">8.2-2</span></a>)</td> <td class="tdleft"><code class="code">IndependentSet</code> in <span class="URL"><a href="https://gap-packages.github.io/grape";>Grape</a></span> is equivalent to <code class="func">DigraphIndependentSet</code> (<a href="chap8.html#X84350678782BFAB7"><span class="RefLink">8.2-2</span></a>) in <strong class="pkg">Digraphs</strong>.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X7E51B92F7E89E266" name="X7E51B92F7E89E266"></a></p> @@ -426,7 +426,7 @@ <td class="tdleft">None</td> <td class="tdleft">There is no analogous function in <strong class="pkg">Digraphs</strong>. However, the same results would be possible by calling <code class="func">DigraphCopy</code> (<a href="chap3.html#X83D93A8A8251E6F9"><span class="RefLink">3.3-1</span></a>) on the digraph to produce a copy <code class="code">gr</code>, and then applying <code class="code">SetDigraphGroup(gr, G)</code>.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X7A61E3FC7A2BB50E" name="X7A61E3FC7A2BB50E"></a></p> @@ -456,7 +456,7 @@ <td class="tdleft"><code class="func">DigraphCliques</code> (<a href="chap8.html#X84EA2F9482B8D4AF"><span class="RefLink">8.1-4</span></a>)</td> <td class="tdleft">Much of the functionality of <code class="code">CompleteSubgraphsOfGivenSize</code> in <span class="URL"><a href="https://gap-packages.github.io/grape";>Grape</a></span> is provided by <code class="func">DigraphCliques</code> (<a href="chap8.html#X84EA2F9482B8D4AF"><span class="RefLink">8.1-4</span></a>) and <code class="func">DigraphMaximalCliques</code> (<a href="chap8.html#X84EA2F9482B8D4AF"><span class="RefLink">8.1-4</span></a>) in <strong class="pkg">Digraphs</strong>, except that the functionality relating to vertex weights and partial colourings is not implemented.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X7DFC61EC7CBDBC7E" name="X7DFC61EC7CBDBC7E"></a></p> @@ -491,7 +491,7 @@ <td class="tdleft">None</td> <td class="tdleft">There is no analogous function in <strong class="pkg">Digraphs</strong>, although this feature might be implemented in the future.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/doc/chapA_mj.html new/digraphs-1.7.1/doc/chapA_mj.html --- old/digraphs-1.7.0/doc/chapA_mj.html 2024-02-14 19:55:47.000000000 +0100 +++ new/digraphs-1.7.1/doc/chapA_mj.html 2024-02-19 20:25:54.000000000 +0100 @@ -129,7 +129,7 @@ <td class="tdleft"><code class="func">SetDigraphVertexLabels</code> (<a href="chap5_mj.html#X7E51F2FE87140B32"><span class="RefLink">5.1-10</span></a>) and <code class="func">SetDigraphVertexLabel</code> (<a href="chap5_mj.html#X7CA91E4B7904F793"><span class="RefLink">5.1-9</span></a>)</td> <td class="tdleft">Use <code class="func">SetDigraphVertexLabel</code> (<a href="chap5_mj.html#X7CA91E4B7904F793"><span class="RefLink">5.1-9</span></a>) to set an individual vertex label and <code class="func">SetDigraphVertexLabels</code> (<a href="chap5_mj.html#X7E51F2FE87140B32"><span class="RefLink">5.1-10</span></a>) to set all of the vertex labels.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X7C38A6397D2770FB" name="X7C38A6397D2770FB"></a></p> @@ -249,7 +249,7 @@ <td class="tdleft"><code class="func">IsCompleteDigraph</code> (<a href="chap6_mj.html#X81F28D4D879FE3B2"><span class="RefLink">6.2-5</span></a>)</td> <td class="tdleft">The <span class="URL"><a href="https://gap-packages.github.io/grape";>Grape</a></span> function <code class="code">IsCompleteGraph</code> is roughly equivalent to <code class="func">IsCompleteDigraph</code> (<a href="chap6_mj.html#X81F28D4D879FE3B2"><span class="RefLink">6.2-5</span></a>) except that in <strong class="pkg">Digraphs</strong> a complete digraph has <em>no loops</em>.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X78A5A34783C70CD7" name="X78A5A34783C70CD7"></a></p> @@ -299,7 +299,7 @@ <td class="tdleft">None</td> <td class="tdleft">The <span class="URL"><a href="https://gap-packages.github.io/grape";>Grape</a></span> function <code class="code">VertexTransitiveDRGs</code> has no equivalent function in <strong class="pkg">Digraphs</strong>, although this might change in the future.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X7C74978D85F7AF5C" name="X7C74978D85F7AF5C"></a></p> @@ -344,7 +344,7 @@ <td class="tdleft"><code class="func">DigraphIndependentSet</code> (<a href="chap8_mj.html#X84350678782BFAB7"><span class="RefLink">8.2-2</span></a>)</td> <td class="tdleft"><code class="code">IndependentSet</code> in <span class="URL"><a href="https://gap-packages.github.io/grape";>Grape</a></span> is equivalent to <code class="func">DigraphIndependentSet</code> (<a href="chap8_mj.html#X84350678782BFAB7"><span class="RefLink">8.2-2</span></a>) in <strong class="pkg">Digraphs</strong>.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X7E51B92F7E89E266" name="X7E51B92F7E89E266"></a></p> @@ -429,7 +429,7 @@ <td class="tdleft">None</td> <td class="tdleft">There is no analogous function in <strong class="pkg">Digraphs</strong>. However, the same results would be possible by calling <code class="func">DigraphCopy</code> (<a href="chap3_mj.html#X83D93A8A8251E6F9"><span class="RefLink">3.3-1</span></a>) on the digraph to produce a copy <code class="code">gr</code>, and then applying <code class="code">SetDigraphGroup(gr, G)</code>.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X7A61E3FC7A2BB50E" name="X7A61E3FC7A2BB50E"></a></p> @@ -459,7 +459,7 @@ <td class="tdleft"><code class="func">DigraphCliques</code> (<a href="chap8_mj.html#X84EA2F9482B8D4AF"><span class="RefLink">8.1-4</span></a>)</td> <td class="tdleft">Much of the functionality of <code class="code">CompleteSubgraphsOfGivenSize</code> in <span class="URL"><a href="https://gap-packages.github.io/grape";>Grape</a></span> is provided by <code class="func">DigraphCliques</code> (<a href="chap8_mj.html#X84EA2F9482B8D4AF"><span class="RefLink">8.1-4</span></a>) and <code class="func">DigraphMaximalCliques</code> (<a href="chap8_mj.html#X84EA2F9482B8D4AF"><span class="RefLink">8.1-4</span></a>) in <strong class="pkg">Digraphs</strong>, except that the functionality relating to vertex weights and partial colourings is not implemented.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> <p><a id="X7DFC61EC7CBDBC7E" name="X7DFC61EC7CBDBC7E"></a></p> @@ -494,7 +494,7 @@ <td class="tdleft">None</td> <td class="tdleft">There is no analogous function in <strong class="pkg">Digraphs</strong>, although this feature might be implemented in the future.</td> </tr> -</table><br /><p> </p><br /> +</table><br /> </div> Binary files old/digraphs-1.7.0/doc/manual.pdf and new/digraphs-1.7.1/doc/manual.pdf differ diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/gap/digraph.gi new/digraphs-1.7.1/gap/digraph.gi --- old/digraphs-1.7.0/gap/digraph.gi 2024-02-14 17:54:52.000000000 +0100 +++ new/digraphs-1.7.1/gap/digraph.gi 2024-02-19 18:17:02.000000000 +0100 @@ -699,8 +699,8 @@ InstallMethod(String, "for a digraph", [IsDigraph], function(D) - local n, N, i, mut, streps, outnbs_rep, lengths, strings, creators_streps, - creators_props, props; + local n, N, i, mut, streps, outnbs_rep, lengths, strings, + out_neighbours_string, creators_streps, creators_props, props; if IsMutableDigraph(D) then mut := "IsMutableDigraph, "; else @@ -722,7 +722,11 @@ ReplacedString(streps[n], "\\", "\\\\"), "\"", ")")); od; - outnbs_rep := Concatenation("Digraph(", mut, String(OutNeighbours(D)), ")"); + out_neighbours_string := String(OutNeighbours(D)); + # print empty lists with two spaces for consistency + # see https://github.com/gap-system/gap/pull/5418 + out_neighbours_string := ReplacedString(out_neighbours_string, "[ ]", "[ ]"); + outnbs_rep := Concatenation("Digraph(", mut, out_neighbours_string, ")"); Add(strings, String(outnbs_rep)); N := DigraphNrVertices(D); diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/src/pkgconfig.h.in new/digraphs-1.7.1/src/pkgconfig.h.in --- old/digraphs-1.7.0/src/pkgconfig.h.in 2024-02-14 19:55:48.000000000 +0100 +++ new/digraphs-1.7.1/src/pkgconfig.h.in 2024-02-19 20:25:55.000000000 +0100 @@ -6,10 +6,10 @@ /* Define to 1 if you have the <inttypes.h> header file. */ #undef HAVE_INTTYPES_H -/* Define to 1 if you have the `bliss' library (-lbliss). */ +/* Define to 1 if you have the 'bliss' library (-lbliss). */ #undef HAVE_LIBBLISS -/* Define to 1 if you have the `planarity' library (-lplanarity). */ +/* Define to 1 if you have the 'planarity' library (-lplanarity). */ #undef HAVE_LIBPLANARITY /* Define to 1 if you have the <stdint.h> header file. */ @@ -60,7 +60,7 @@ /* Define to the version of this package. */ #undef PACKAGE_VERSION -/* Define to 1 if all of the C90 standard headers exist (not just the ones +/* Define to 1 if all of the C89 standard headers exist (not just the ones required in a freestanding environment). This macro is provided for backward compatibility; new code need not use it. */ #undef STDC_HEADERS diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' '--exclude=.svnignore' --exclude Makefile.in --exclude configure --exclude config.guess --exclude '*.pot' --exclude mkinstalldirs --exclude aclocal.m4 --exclude config.sub --exclude depcomp --exclude install-sh --exclude ltmain.sh old/digraphs-1.7.0/tst/standard/digraph.tst new/digraphs-1.7.1/tst/standard/digraph.tst --- old/digraphs-1.7.0/tst/standard/digraph.tst 2024-02-14 17:54:52.000000000 +0100 +++ new/digraphs-1.7.1/tst/standard/digraph.tst 2024-02-19 18:17:02.000000000 +0100 @@ -1179,9 +1179,9 @@ gap> gr2 := DigraphCopy(gr1); <immutable empty digraph with 0 vertices> gap> String(gr2); -"Digraph([ ])" +"Digraph([ ])" gap> PrintString(gr2); -"Digraph([ ])" +"Digraph([ ])" gap> D := CycleDigraph(10 * 10 ^ 5); <immutable cycle digraph with 1000000 vertices> gap> D1 := DigraphCopy(D); @@ -1348,7 +1348,7 @@ gap> D := DigraphNC(IsMutableDigraph, list); <mutable digraph with 2 vertices, 2 edges> gap> PrintString(D); -"Digraph(IsMutableDigraph, [ [ 1, 2 ], [ ] ])" +"Digraph(IsMutableDigraph, [ [ 1, 2 ], [ ] ])" gap> EvalString(String(D)) = D; true gap> DigraphByAdjacencyMatrix(IsMutableDigraph, []); @@ -1802,7 +1802,7 @@ gap> D := Digraph([]); <immutable empty digraph with 0 vertices> gap> String(D); -"Digraph([ ])" +"Digraph([ ])" gap> D := CompleteDigraph(7); <immutable complete digraph with 7 vertices> gap> String(D);
