Prepare package for v0.14.0 release

CHANGELOG.md

@@ -3,6 +3,37 @@ Copyright (C) 2014-18 by Jan De Beule, Julius Jonušas, James D. Mitchell, Micha
 
 Licensing information can be found in the LICENSE file.
 
+## Version 0.14.0 (released 23/11/2018)
+
+This release contains bugfixes and a couple of new features.
+
+* The operations `AsSemigroup` and `AsMonoid` for lattice and semilattice
+  digraphs were added by Chris Russell in [PR
+  #136](https://github.com/gap-packages/Digraphs/pull/136).
+* The operation `IsDigraphColouring` was added by [James D.
+  Mitchell](http://goo.gl/ZtViV6) in [PR
+  #145](https://github.com/gap-packages/Digraphs/pull/145).
+* In previous versions of the package, the output of `ArticulationPoints` would
+  sometimes contain repeated vertices (reported by Luke Elliott in [Issue
+  #140](https://github.com/gap-packages/Digraphs/issues/140), and fixed by
+  [James D.  Mitchell](http://goo.gl/ZtViV6) in [PR
+  #142](https://github.com/gap-packages/Digraphs/pull/142)).
+* In previous versions of the package, an unexpected error was sometimes caused
+  when removing an immutable set of vertices from a digraph (reported and fixed
+  by [James D.  Mitchell](http://goo.gl/ZtViV6) in [PR
+  #146](https://github.com/gap-packages/Digraphs/pull/146)).
+* The header file `x86intrin.h` was unnecessarily being included by the kernel
+  module of Digraphs (reported by [Wilf A. Wilson](http://wilf.me) in [Issue
+  #147](https://github.com/gap-packages/Digraphs/issues/147), and fixed by
+  [James D.  Mitchell](http://goo.gl/ZtViV6) in [PR
+  #152](https://github.com/gap-packages/Digraphs/pull/152)).
+
+[Max Horn](https://github.com/fingolfin) also contributed various compatibility
+and correctness changes to the kernel module of the package.
+
+Digraphs now requires version 4.8.1 of the [orb
+package](https://gap-packages.github.io/orb), or newer.
+
 ## Version 0.13.0 (released 19/09/2018)
 
 This release of Digraphs contains some bugfixes, along with the following new features:

PackageInfo.g

@@ -9,20 +9,20 @@
 ##
 
 ##  <#GAPDoc Label="PKGVERSIONDATA">
-##  <!ENTITY VERSION        "0.13.0">
+##  <!ENTITY VERSION        "0.14.0">
 ##  <!ENTITY GAPVERS        "4.9.0">
 ##  <!ENTITY GRAPEVERS      "4.8.1">
 ##  <!ENTITY IOVERS         "4.5.1">
 ##  <!ENTITY ORBVERS        "4.8.1">
-##  <!ENTITY ARCHIVENAME    "digraphs-0.13.0">
+##  <!ENTITY ARCHIVENAME    "digraphs-0.14.0">
 ##  <!ENTITY COPYRIGHTYEARS "2014-18">
 ##  <#/GAPDoc>
 
 SetPackageInfo(rec(
 PackageName := "Digraphs",
 Subtitle := "Graphs, digraphs, and multidigraphs in GAP",
-Version := "0.13.0",
-Date := "19/09/2018",
+Version := "0.14.0",
+Date := "23/11/2018",
 ArchiveFormats := ".tar.gz",
 
 SourceRepository := rec(

README.md

@@ -5,7 +5,7 @@
 
 ### Digraphs package for GAP
 
-#### Copyright (C) 2014-17 by Jan De Beule, Julius Jonušas, James D. Mitchell, Michael Torpey, Wilf A. Wilson et al.
+#### Copyright (C) 2014-18 by Jan De Beule, Julius Jonušas, James D. Mitchell, Michael Torpey, Wilf A. Wilson et al.
 ## Getting Digraphs
 
 To get the latest version of the package, download the archive file
@@ -34,9 +34,9 @@ The following is a summary of the steps that should lead to a successful
 installation of [Digraphs](https://gap-packages.github.io/Digraphs):
 
 * get the [IO](http://gap-packages.github.io/io) package version 4.5.1 or higher.
-* get the [orb](http://gap-packages.github.io/orb) package version 4.7.5 or
+* get the [orb](http://gap-packages.github.io/orb) package version 4.8.1 or
   higher.
-* **this step is optional:** certain methods in [Digraphs](https://gap-packages.github.io/Digraphs) require the [Grape](http://www.maths.qmul.ac.uk/~leonard/grape/) package to be available; a full list of these functions can be found in the first chapter of the manual.  To use these functions make sure that the [Grape](http://www.maths.qmul.ac.uk/~leonard/grape/) package version 4.5 or higher is available.
+* **this step is optional:** certain methods in [Digraphs](https://gap-packages.github.io/Digraphs) require the [Grape](http://www.maths.qmul.ac.uk/~leonard/grape/) package to be available; a full list of these functions can be found in the first chapter of the manual.  To use these functions make sure that the [Grape](http://www.maths.qmul.ac.uk/~leonard/grape/) package version 4.8.1 or higher is available.
 * download the package archive `digraphs-x.x.x.tar.gz` from the
   [Digraphs](https://gap-packages.github.io/Digraphs) webpage.
 * unzip and untar the file `digraphs-x.x.x.tar.gz` using, for example,

VERSION

@@ -1 +1 @@
-0.13.0
+0.14.0

VERSIONS

@@ -8,6 +8,7 @@
 #############################################################################
 ##
 
+release 0.14.0 - 23/11/2018
 release 0.13.0 - 19/09/2018
 release 0.12.2 - 24/08/2018
 release 0.12.1 - 26/04/2018

doc/oper.xml

@@ -1507,8 +1507,8 @@ true
 <#GAPDoc Label="AsSemigroup">
   <ManSection>
     <Oper Name="AsSemigroup" Arg="filt, digraph"/>
-    <Oper Name="AsMonoid" Arg="filt, digraph"/>    
-    <Returns> A semilattice of partial perms. </Returns>
+    <Oper Name="AsMonoid" Arg="filt, digraph"/>
+    <Returns>A semilattice of partial perms.</Returns>
     <Description>
       The operation <C>AsSemigroup</C> requires that <A>filt</A> be equal to
       <Ref Filt="IsPartialPermSemigroup" BookName="ref"/>.
@@ -1517,7 +1517,7 @@ true
       then <C>AsSemigroup</C> returns a semigroup of partial perms which is
       isomorphic to the semigroup whose elements are the vertices of
       <A>digraph</A> with the binary operation
-      <Ref Oper="PartialOrderDigraphJoinOfVertices" 
+      <Ref Oper="PartialOrderDigraphJoinOfVertices"
         Label="for a digraph and two vertices"/>. If <A>digraph</A>
       satisfies  <Ref Prop="IsMeetSemilatticeDigraph"/> but not
       <Ref Prop="IsJoinSemilatticeDigraph"/> then

tst/standard/oper.tst

@@ -863,7 +863,7 @@ gap> gr4 := DigraphRemoveVertices(gr, []);
 <digraph with 4 vertices, 16 edges>
 gap> gr = gr4;
 true
-gap> gr := Digraph([[1, 10], [], [], [3], [3, 4, 10], [1, 3, 8], 
+gap> gr := Digraph([[1, 10], [], [], [3], [3, 4, 10], [1, 3, 8],
 > [9], [9], [3], [3, 5, 10]]);
 <digraph with 10 vertices, 15 edges>
 gap> DigraphSinks(gr);