From 304493d5cf1047a28ebd348a310707145c604f3d Mon Sep 17 00:00:00 2001 From: "James D. Mitchell" Date: Wed, 27 Jan 2021 20:25:01 +0000 Subject: [PATCH 1/8] Update version numbers etc for v1.4.0 --- .VERSION | 2 +- CHANGELOG.md | 37 +++++++++++++++++++++++++++++++++++++ PackageInfo.g | 8 ++++---- VERSIONS | 1 + 4 files changed, 43 insertions(+), 5 deletions(-) diff --git a/.VERSION b/.VERSION index 3a3cd8cc8..88c5fb891 100644 --- a/.VERSION +++ b/.VERSION @@ -1 +1 @@ -1.3.1 +1.4.0 diff --git a/CHANGELOG.md b/CHANGELOG.md index 51c76c41c..0eff5fcf0 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -4,6 +4,43 @@ Torpey, Wilf A. Wilson et al. Licensing information can be found in the `LICENSE` file. +## Version 1.4.0 (released 27/01/2021) + +In this release there are several new features and improvements. + +The following improvements and bugs have been made: + +* the clique finder was reimplemented in C by [Julius Jonusas][] +* a critical bug in `CayleyDigraph` was reported and fixed by [Jan De Beule][] +* a minor bug in `ReadDigraphs` was fixed reported by [Wilf A. Wilson][] and + fixed by [James D. Mitchell][] +* the performance of `BlissCanonicalLabelling` and `BlissAutomorphismGroup` was + improved for multidigraphs by Marina Anagnostopoulou-Merkouri and Sam + Harper. +* a bug in `GeneratorsOfEndomorphismMonoid` that caused GAP to crash when + called with a multidigraph was reported by [Wilf A. Wilson][] and + fixed by [James D. Mitchell][] +* [Wilf A. Wilson][] made some improvements to the manual. +* the performance of `DigraphCopy` was improved by Marina + Anagnostopoulou-Merkouri and Sam Harper. + +The main new features are: + +* the attribute `DigraphNrLoops` was introduced by Marina + Anagnostopoulou-Merkouri and Sam Harper. +* the operations + * `DotColoredDigraph` + * `DotVertexColoredDigraph` + * `DotEdgeColoredDigraph` + * `DotSymmetricColoredDigraph` + * `DotSymmetricVertexColoredDigraph` + * `DotSymmetricEdgeColoredDigraph` + were introduced by Marina Anagnostopoulou-Merkouri and Sam Harper. +* the operation `VerticesReachableFrom` was introduced by + Marina Anagnostopoulou-Merkouri. +* the operation `ModularProduct` was introduced by Luke Elliott and + [James D. Mitchell][] + ## Version 1.3.1 (released 27/11/2020) This is a minor release fixing some issues, some performance improvements, and diff --git a/PackageInfo.g b/PackageInfo.g index f891bee13..74c3f3671 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.3.1", -Date := "27/11/2020", # dd/mm/yyyy format +Version := "1.4.0", +Date := "27/01/2021", # dd/mm/yyyy format License := "GPL-3.0-or-later", ArchiveFormats := ".tar.gz", diff --git a/VERSIONS b/VERSIONS index b2bcad759..a9acd2950 100644 --- a/VERSIONS +++ b/VERSIONS @@ -8,6 +8,7 @@ ############################################################################# ## +release 1.4.0 - 27/01/2021 release 1.3.1 - 27/11/2020 release 1.3.0 - 27/06/2020 release 1.2.1 - 27/05/2020 From 27aa77e5f5ac6712b9a5c5e8fed6d2e213878193 Mon Sep 17 00:00:00 2001 From: Wilf Wilson Date: Wed, 27 Jan 2021 17:38:07 +0000 Subject: [PATCH 2/8] doc/main.xml: update Grape URL and fix Orb URL --- doc/main.xml | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/main.xml b/doc/main.xml index d77762c4a..66ce99e89 100644 --- a/doc/main.xml +++ b/doc/main.xml @@ -1,7 +1,7 @@ Digraphs"> http://www.maths.qmul.ac.uk/~leonard/grape/https://gap-packages.github.io/grapeGrape"> http://www.tcs.tkk.fi/Software/bliss/IO"> - http://http://gap-packages.github.io/orb/ + https://gap-packages.github.io/orb/ Orb"> https://github.com/gap-packages/datastructures Date: Wed, 27 Jan 2021 17:37:21 +0000 Subject: [PATCH 3/8] CHANGELOG.md: use link variables more often --- CHANGELOG.md | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/CHANGELOG.md b/CHANGELOG.md index ec4cfd23b..b24d8bbc3 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -384,7 +384,7 @@ Other additions and changes are listed below: Suite](https://github.com/graph-algorithms/edge-addition-planarity-suite) is now included in Digraphs, and so it is now possible to test digraphs for planarity, and to perform related computations. This was added by [James D. - Mitchell](http://goo.gl/ZtViV6) in [PR + Mitchell][] in [PR #156](https://github.com/digraphs/Digraphs/pull/156). The new functionality can be accessed via: * `Is(Outer)PlanarDigraph`, @@ -403,14 +403,14 @@ Other additions and changes are listed below: `DigraphWelshPowellOrder`. The behaviour of `DigraphGreedyColouring` can be modified by including an optional second argument; see the documentation for more information. This work was done by [James D. - Mitchell](http://goo.gl/ZtViV6) in [PR + Mitchell][] in [PR #144](https://github.com/digraphs/Digraphs/pull/144). * `DigraphShortestPath` was introduced by Murray Whyte in [PR #148](https://github.com/digraphs/Digraphs/pull/148). * `IsAntiSymmetricDigraph` (with a capital S) was added as a synonym for `IsAntisymmetricDigraph`. * `RandomDigraph` now allows a float as its second argument; by [James D. - Mitchell](http://goo.gl/ZtViV6) in [PR + Mitchell][] in [PR #159](https://github.com/digraphs/Digraphs/pull/159). * The attribute `CharacteristcPolynomial` for a digraph was added by Luke Elliott in [PR #164](https://github.com/digraphs/Digraphs/pull/164). @@ -426,7 +426,7 @@ This release contains bugfixes and a couple of new features. digraphs were added by Chris Russell in [PR #136](https://github.com/digraphs/Digraphs/pull/136). * The operation `IsDigraphColouring` was added by [James D. - Mitchell](http://goo.gl/ZtViV6) in [PR + Mitchell][] in [PR #145](https://github.com/digraphs/Digraphs/pull/145). * In previous versions of the package, the output of `ArticulationPoints` would sometimes contain repeated vertices (reported by Luke Elliott in [Issue From 773b108c993e23e588d17a97cd33417d1eaee7aa Mon Sep 17 00:00:00 2001 From: Wilf Wilson Date: Wed, 27 Jan 2021 17:38:51 +0000 Subject: [PATCH 4/8] =?UTF-8?q?Change=20http=E2=86=92https=20where=20possi?= =?UTF-8?q?ble?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- CHANGELOG.md | 10 +++++----- LICENSE | 2 +- PackageInfo.g | 2 +- ci/docker-test.sh | 2 +- doc/digraphs.bib | 28 ++++++++++++++-------------- doc/display.xml | 12 ++++++------ doc/main.xml | 4 ++-- doc/z-chap1.xml | 4 ++-- doc/z-title.xml | 4 ++-- gap/attr.gi | 2 +- gap/prop.gi | 2 +- gap/utils.gi | 2 +- src/digraphs-debug.h | 2 +- src/digraphs.c | 2 +- 14 files changed, 39 insertions(+), 39 deletions(-) diff --git a/CHANGELOG.md b/CHANGELOG.md index b24d8bbc3..b620d10a5 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -501,11 +501,11 @@ Digraphs now requires version 4.5.1 of the IO package. The principal change in Digraphs version 0.11.0 is the addition of support for computing automorphisms, canonical labellings, and isomorphisms of -digraphs with [nauty](http://pallini.di.uniroma1.it/). This +digraphs with [nauty](https://pallini.di.uniroma1.it/). This functionality requires the [NautyTracesInterface package](https://github.com/gap-packages/NautyTracesInterface) for GAP, version 0.2 or newer. However, this is not a required package, and the default engine -remains [bliss](http://www.tcs.hut.fi/Software/bliss/). It is possible to +remains [bliss][]. It is possible to specify the engine that is used by Digraphs. These changes to Digraphs were made by [James D. Mitchell][]]. @@ -679,7 +679,7 @@ digraphs are set at creation [[Michael Torpey][]] ## Version 0.5.0 (released 03/03/2016) This release contains some bugfixes, as well as new and changed functionality. -Digraphs now requires the [Orb package](http://gap-packages.github.io/orb), +Digraphs now requires the [Orb package](https://gap-packages.github.io/orb), version 4.7.5 or higher. ### New Features in Version 0.5.0 @@ -782,7 +782,7 @@ This release contains a number of bugfixes and performance improvements. ### New Features in Version 0.3.0 * The attribute `DigraphAllSimpleCircuits` based -on the algorithm in [this paper](http://epubs.siam.org/doi/abs/10.1137/0204007?journalCode=smjcat) by Donald B. Johnson. [Stuart Burrell and [Wilf A. Wilson][]] +on the algorithm in [this paper](https://epubs.siam.org/doi/abs/10.1137/0204007) by Donald B. Johnson. [Stuart Burrell and [Wilf A. Wilson][]] * Improve efficiency of the algorithm for coloring a graph with 2 colours, a method for `IsBipartiteDigraph` and `DigraphBicomponents`. [Isabella Scott and [Wilf A. Wilson][]] * `AutomorphismGroup` and `DigraphCanonicalLabelling` can now be used with color classes that are preserved by the permutations acting on a digraph. [[James D. Mitchell][]] * The `TCodeDecoder` was made more efficient. [[James D. Mitchell][]] @@ -801,7 +801,7 @@ The first release. Pre-release version that was not made publicly available. [James D. Mitchell]: https://jdbm.me -[Wilf A. Wilson]: http://wilf.me +[Wilf A. Wilson]: https://wilf.me [Michael Torpey]: https://mtorpey.github.io [Julius Jonusas]: http://julius.jonusas.work [Jan De Beule]: http://homepages.vub.ac.be/~jdbeule diff --git a/LICENSE b/LICENSE index 2eb147c2f..4976c661d 100644 --- a/LICENSE +++ b/LICENSE @@ -14,4 +14,4 @@ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License -along with this program. If not, see . +along with this program. If not, see . diff --git a/PackageInfo.g b/PackageInfo.g index 74c3f3671..5599e04d7 100644 --- a/PackageInfo.g +++ b/PackageInfo.g @@ -109,7 +109,7 @@ Persons := [ IsAuthor := false, IsMaintainer := false, Email := "caj21@st-andrews.ac.uk", - WWWHome := "http://caj.host.cs.st-andrews.ac.uk", + WWWHome := "https://caj.host.cs.st-andrews.ac.uk", PostalAddress := _STANDREWSCS, Place := "St Andrews", Institution := "University of St Andrews"), diff --git a/ci/docker-test.sh b/ci/docker-test.sh index 2e149807c..65c8414c2 100755 --- a/ci/docker-test.sh +++ b/ci/docker-test.sh @@ -81,7 +81,7 @@ fi if [ "$SUITE" == "conda" ]; then bold "Installing dependencies (conda). . ." - wget http://repo.continuum.io/miniconda/Miniconda3-latest-Linux-x86_64.sh -O miniconda.sh; + wget https://repo.continuum.io/miniconda/Miniconda3-latest-Linux-x86_64.sh -O miniconda.sh; chmod +x miniconda.sh; ./miniconda.sh -b; export PATH=/home/gap/miniconda3/bin:$PATH; diff --git a/doc/digraphs.bib b/doc/digraphs.bib index 43be8f3fd..54ba84476 100644 --- a/doc/digraphs.bib +++ b/doc/digraphs.bib @@ -26,15 +26,15 @@ @article{CK86 Number = {2}, Pages = {97--122}, Title = {The geometry of two-weight codes}, - Url = {http://dx.doi.org/10.1112/blms/18.2.97}, + Url = {https://dx.doi.org/10.1112/blms/18.2.97}, Volume = {18}, Year = {1986}, - Bdsk-Url-1 = {http://dx.doi.org/10.1112/blms/18.2.97}, + Bdsk-Url-1 = {https://dx.doi.org/10.1112/blms/18.2.97}, } @article{Gab00, Author = {Harold N. Gabow}, - Doi = {http://dx.doi.org/10.1016/S0020-0190(00)00051-X}, + Doi = {https://dx.doi.org/10.1016/S0020-0190(00)00051-X}, Issn = {0020-0190}, Journal = {Information Processing Letters}, Keywords = {Algorithms}, @@ -42,11 +42,11 @@ @article{Gab00 Pages = {107 - 114}, Title = {Path-based depth-first search for strong and biconnected components}, - Url = {http://www.sciencedirect.com/science/article/pii/S002001900000051X}, + Url = {https://www.sciencedirect.com/science/article/pii/S002001900000051X}, Volume = {74}, Year = {2000}, - Bdsk-Url-2 = {http://dx.doi.org/10.1016/S0020-0190(00)00051-X}, - Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S002001900000051X}, + Bdsk-Url-2 = {https://dx.doi.org/10.1016/S0020-0190(00)00051-X}, + Bdsk-Url-1 = {https://www.sciencedirect.com/science/article/pii/S002001900000051X}, } @inproceedings{JK07, @@ -68,17 +68,17 @@ @inproceedings{JK07 @article{MP14, Author = {Brendan D. McKay and Adolfo Piperno}, - Doi = {http://dx.doi.org/10.1016/j.jsc.2013.09.003}, + Doi = {https://dx.doi.org/10.1016/j.jsc.2013.09.003}, Issn = {0747-7171}, Journal = {Journal of Symbolic Computation}, Number = {0}, Pages = {94 - 112}, Title = {Practical graph isomorphism, {II}}, - Url = {http://www.sciencedirect.com/science/article/pii/S0747717113001193}, + Url = {https://www.sciencedirect.com/science/article/pii/S0747717113001193}, Volume = {60}, Year = {2014}, - Bdsk-Url-2 = {http://dx.doi.org/10.1016/j.jsc.2013.09.003}, - Bdsk-Url-1 = {http://www.sciencedirect.com/science/article/pii/S0747717113001193}, + Bdsk-Url-2 = {https://dx.doi.org/10.1016/j.jsc.2013.09.003}, + Bdsk-Url-1 = {https://www.sciencedirect.com/science/article/pii/S0747717113001193}, } @article{vLS81, @@ -96,10 +96,10 @@ @article{vLS81 Pages = {63--73}, Title = {Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields}, - Url = {http://dx.doi.org/10.1007/BF02579178}, + Url = {https://dx.doi.org/10.1007/BF02579178}, Volume = {1}, Year = {1981}, - Bdsk-Url-1 = {http://dx.doi.org/10.1007/BF02579178}, + Bdsk-Url-1 = {https://dx.doi.org/10.1007/BF02579178}, } % FIXME The Welsh paper is not cited in the manual! @@ -112,8 +112,8 @@ @article{Welsh1967aa Pages = {85-86}, Title = {An upper bound for the chromatic number of a graph and its application to timetabling problems}, - Url = {http://dx.doi.org/10.1093/comjnl/10.1.85}, + Url = {https://dx.doi.org/10.1093/comjnl/10.1.85}, Volume = {10}, Year = {1967}, - Bdsk-Url-1 = {http://dx.doi.org/10.1093/comjnl/10.1.85} + Bdsk-Url-1 = {https://dx.doi.org/10.1093/comjnl/10.1.85} } diff --git a/doc/display.xml b/doc/display.xml index ec62174b4..c0ea14f60 100644 --- a/doc/display.xml +++ b/doc/display.xml @@ -20,8 +20,8 @@ The string str must correspond to a valid dot or LaTeX text file and you must have have GraphViz and pdflatex installed on your computer. For details about these file - formats, see http://www.latex-project.org and - http://www.graphviz.org.

+ formats, see https://www.latex-project.org and + https://www.graphviz.org.

This function is provided to allow convenient, immediate viewing of the pictures produced by the function .

@@ -147,7 +147,7 @@ gap> Splash(DotDigraph(RandomDigraph(4))); 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 http://www.graphviz.org.

+ display or edit this format see https://www.graphviz.org.

The string returned by DotDigraph or DotVertexLabelledDigraph can be written to a file using @@ -411,7 +411,7 @@ gap> FileString("dot/k4.dot", DotDigraph(gr)); 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 - http://www.graphviz.org.

+ https://www.graphviz.org.

The string returned by DotSymmetricDigraph can be written to a file using the command .

@@ -502,7 +502,7 @@ node [shape=circle] 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 - http://www.graphviz.org.

+ https://www.graphviz.org.

The string returned by DotPartialOrderDigraph can be written to a file using the command .

@@ -543,7 +543,7 @@ gap> FileString("dot/poset.dot", DotPartialOrderDigraph(gr)); 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 - http://www.graphviz.org.

+ https://www.graphviz.org.

The string returned by DotPreorderDigraph can be written to a file using the command .

diff --git a/doc/main.xml b/doc/main.xml index 66ce99e89..8983dd788 100644 --- a/doc/main.xml +++ b/doc/main.xml @@ -10,13 +10,13 @@ Text='edge-addition-planarity-suite'>https://github.com/graph-algorithms/edge-addition-planarity-suiteedge-addition-planarity-suite"> http://pallini.di.uniroma1.it/https://pallini.di.uniroma1.it/nauty"> https://github.com/gap-packages/NautyTracesInterfaceNautyTracesInterface"> - http://gap-packages.github.io/io/ + https://gap-packages.github.io/io/ IO"> https://gap-packages.github.io/orb/ diff --git a/doc/z-chap1.xml b/doc/z-chap1.xml index e276b8c66..3d09ee031 100644 --- a/doc/z-chap1.xml +++ b/doc/z-chap1.xml @@ -9,7 +9,7 @@ It is assumed that you have a working copy of &GAP; with version number &GAPVERS; or higher. The most up-to-date version of &GAP; and instructions on how to install it can be obtained from the main &GAP; webpage - http://www.gap-system.org.

+ https://www.gap-system.org.

The following is a summary of the steps that should lead to a successful installation of &Digraphs;: @@ -58,7 +58,7 @@ download the package archive &ARCHIVENAME;.tar.gz from - http://digraphs.github.io/Digraphs/. + https://digraphs.github.io/Digraphs/. diff --git a/doc/z-title.xml b/doc/z-title.xml index 2d8610b0c..7f649c0ed 100644 --- a/doc/z-title.xml +++ b/doc/z-title.xml @@ -24,7 +24,7 @@ Wilf A. Wilson gap@wilf-wilson.net - http://wilf.me + https://wilf.me Stuart Burrell @@ -51,7 +51,7 @@ &Digraphs; is free software; you can redistribute it and/or modify it under the terms of the - http://www.fsf.org/licenses/gpl.html as published by the Free Software + https://www.fsf.org/licenses/gpl.html as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. diff --git a/gap/attr.gi b/gap/attr.gi index 599bb018b..396c1863d 100644 --- a/gap/attr.gi +++ b/gap/attr.gi @@ -16,7 +16,7 @@ InstallMethod(OutNeighbours, "for a digraph by out-neighbours", # The next method is (yet another) DFS which simultaneously computes: # 1. *articulation points* as described in -# http://www.eecs.wsu.edu/~holder/courses/CptS223/spr08/slides/graphapps.pdf +# https://www.eecs.wsu.edu/~holder/courses/CptS223/spr08/slides/graphapps.pdf # 2. *bridges* as described in https://stackoverflow.com/q/28917290/ # (this is a minor adaption of the algorithm described in point 1). # 3. a *strong orientation* as alluded to somewhere on the internet that I can diff --git a/gap/prop.gi b/gap/prop.gi index 097b633af..fd7a7e8f1 100644 --- a/gap/prop.gi +++ b/gap/prop.gi @@ -435,7 +435,7 @@ end); # Hamiltonian. # This function uses theorems 4.1 and 4.2 from the following paper: # Sufficient conditions for a digraph to be Hamiltonian -# http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.99.4560&rep=rep1 +# https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.99.4560&rep=rep1 # &type=pdf # A vertex z dominates a pair of vertices {x, y} if z->x and z->y # A pair of vertices {x, y} dominates a vertex z if x->z and y->z diff --git a/gap/utils.gi b/gap/utils.gi index d955cea53..0bc647dfd 100644 --- a/gap/utils.gi +++ b/gap/utils.gi @@ -184,7 +184,7 @@ function(arg) ErrorNoReturn("the file pkg/digraphs/digraphs-lib/extreme.d6.gz is ", "required for these tests to run. Please install the ", "'digraphs-lib'archive from: ", - "http://digraphs.github.io/Digraphs/", + "https://digraphs.github.io/Digraphs/", "and try again,"); fi; diff --git a/src/digraphs-debug.h b/src/digraphs-debug.h index d144cc2b2..22e728710 100644 --- a/src/digraphs-debug.h +++ b/src/digraphs-debug.h @@ -13,7 +13,7 @@ // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License -// along with this program. If not, see . +// along with this program. If not, see . // // This file declares kernel debugging functionality. diff --git a/src/digraphs.c b/src/digraphs.c index 89e84b1ba..abce1268d 100644 --- a/src/digraphs.c +++ b/src/digraphs.c @@ -157,7 +157,7 @@ static Obj FuncDIGRAPH_NREDGES(Obj self, Obj D) { ** Neither the components, nor their elements are in any particular order. ** ** The algorithm is that of Gabow, based on the implementation in Sedgwick: -** http://algs4.cs.princeton.edu/42directed/GabowSCC.java.html +** https://algs4.cs.princeton.edu/42directed/GabowSCC.java.html ** (made non-recursive to avoid problems with stack limits) and ** the implementation of STRONGLY_CONNECTED_COMPONENTS_DIGRAPH in listfunc.c. */ From 290759b4dcb353f35cf839f60ede5a5a60c42d2e Mon Sep 17 00:00:00 2001 From: Wilf Wilson Date: Wed, 27 Jan 2021 17:15:38 +0000 Subject: [PATCH 5/8] =?UTF-8?q?cliques.xml:=20can=20not=20=E2=86=92=20cann?= =?UTF-8?q?ot?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- doc/cliques.xml | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/doc/cliques.xml b/doc/cliques.xml index eac68d714..1e8feaa1b 100644 --- a/doc/cliques.xml +++ b/doc/cliques.xml @@ -145,14 +145,14 @@ true]]> If one or two arguments are supplied, then DigraphClique and DigraphMaximalClique greedily enlarge the clique include - until it can not continue. The result is guaranteed to be a maximal + until it cannot continue. The result is guaranteed to be a maximal clique. This may or may not return an answer more quickly than using . with a limit of 1. Three arguments If three arguments are supplied, then DigraphClique greedily - enlarges the clique include until it can not continue, although + enlarges the clique include until it cannot continue, although this clique may not be maximal.

Given three arguments, DigraphMaximalClique returns the maximal @@ -345,7 +345,7 @@ gap> DigraphMaximalCliques(D); If one or two arguments are supplied, then DigraphIndependentSet and DigraphMaximalIndependentSet greedily enlarge the - independent set include until it can not continue. The result + independent set include until it cannot continue. The result is guaranteed to be a maximal independent set. This may or may not return an answer more quickly than using . with a limit of 1. @@ -353,7 +353,7 @@ gap> DigraphMaximalCliques(D); Three arguments If three arguments are supplied, then DigraphIndependentSet - greedily enlarges the independent set include until it can not + greedily enlarges the independent set include until it cannot continue, although this independent set may not be maximal.

Given three arguments, DigraphMaximalIndependentSet returns the From 6b122223b6d7b31294ce832b3a027834c9b4d245 Mon Sep 17 00:00:00 2001 From: Wilf Wilson Date: Wed, 20 Jan 2021 14:37:35 +0000 Subject: [PATCH 6/8] Fix some weird whitespace issue The linter (at least on my computer) was saying that the second characters in these lines were not spaces. Even though they look like spaces. So I replaced them with actual definite spaces. --- gap/planar.gi | 2 +- tst/standard/prop.tst | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/gap/planar.gi b/gap/planar.gi index 5c9d9bf9d..7150e92a6 100644 --- a/gap/planar.gi +++ b/gap/planar.gi @@ -18,7 +18,7 @@ ######################################################################## # -# This file is organised as follows: +# This file is organised as follows: # # 1. Attributes # diff --git a/tst/standard/prop.tst b/tst/standard/prop.tst index 85e59213b..ed32254ee 100644 --- a/tst/standard/prop.tst +++ b/tst/standard/prop.tst @@ -869,7 +869,7 @@ gap> D := Digraph([[1, 2], [1]]); # has loops gap> IsCompleteMultipartiteDigraph(D); false -gap> D := Digraph([[2], []]); # not symmetric +gap> D := Digraph([[2], []]); # not symmetric gap> IsCompleteMultipartiteDigraph(D); false From a0e29be78656a5f315717e011954ea11bedf6184 Mon Sep 17 00:00:00 2001 From: "James D. Mitchell" Date: Mon, 1 Feb 2021 19:41:38 +0000 Subject: [PATCH 7/8] Fix typo in doc --- doc/oper.xml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/doc/oper.xml b/doc/oper.xml index 4df1a1366..eed7cb54c 100644 --- a/doc/oper.xml +++ b/doc/oper.xml @@ -1374,7 +1374,7 @@ gap> VerticesReachableFrom(D, 5); where for each each i < n, a_i is the position of v_{i+1} in OutNeighboursOfVertex(digraph,v_i) - corresponding to the edge e_i. This is can be useful if the + corresponding to the edge e_i. This can be useful if the position of a vertex in a list of out-neighours is significant, for example in orbit digraphs. From 874a39de4e90737e2305d3e92427bc8836c08a29 Mon Sep 17 00:00:00 2001 From: Wilf Wilson Date: Wed, 3 Feb 2021 16:09:46 +0000 Subject: [PATCH 8/8] ci: test against GAP stable-4.10 on GitHub Actions --- .github/workflows/ci.yml | 21 ++++++++++++--------- 1 file changed, 12 insertions(+), 9 deletions(-) diff --git a/.github/workflows/ci.yml b/.github/workflows/ci.yml index 5b657100c..3d223169a 100644 --- a/.github/workflows/ci.yml +++ b/.github/workflows/ci.yml @@ -19,27 +19,30 @@ jobs: - name: "Run gaplint + cpplint . . ." run: bash etc/lint.sh test: - name: "GAP ${{ matrix.gap-branch }} on ${{ matrix.os }}" - runs-on: ${{ matrix.os }} + name: "GAP ${{ matrix.gap-branch }}" + runs-on: ubuntu-latest strategy: fail-fast: false matrix: - os: - - ubuntu-latest - digraphs-lib: - - digraphs-lib-0.6 gap-branch: - master - stable-4.11 + pkgs-to-clone: + - NautyTracesInterface + + include: + - gap-branch: stable-4.10 + pkgs-to-clone: datastructures steps: - uses: actions/checkout@v2 - uses: gap-actions/setup-gap-for-packages@v1 with: - GAP_PKGS_TO_CLONE: "NautyTracesInterface" + GAP_PKGS_TO_CLONE: "${{ matrix.pkgs-to-clone }}" GAP_PKGS_TO_BUILD: "io orb profiling grape NautyTracesInterface datastructures" GAPBRANCH: ${{ matrix.gap-branch }} - name: "Install digraphs-lib" - run: curl --retry 5 -L -O https://digraphs.github.io/Digraphs/${{ matrix.digraphs-lib }}.tar.gz - && tar xf ${{ matrix.digraphs-lib }}.tar.gz + run: DIGRAPHS_LIB="digraphs-lib-0.6" + && curl --retry 5 -L -O "https://digraphs.github.io/Digraphs/${DIGRAPHS_LIB}.tar.gz" + && tar xf "${DIGRAPHS_LIB}.tar.gz" - uses: gap-actions/run-test-for-packages@v1