gap-digraphs 1.14.0

gap-digraphs.changes

@@ -1,3 +1,87 @@
+-------------------------------------------------------------------
+Fri Jan 23 18:12:15 UTC 2026 - Jan Engelhardt <jengelh@inai.de>
+
+- Update to release 1.14.0
+  * Re-standardise on function arguments named `D`, as opposed to
+    `digraph`
+  * Remove support for GAP 4.10
+  * Abstract RandomDigraphCons redirect methods
+  * Add `SwapDigraphs` and `DigraphsRemoveAllEdges` functions
+  * Implemented ^ operator for digraphs to delegate to OnDigraphs
+  * Added `DigraphMinimumCutSet` function
+
+-------------------------------------------------------------------
+Sun Sep 28 20:39:08 UTC 2025 - Jan Engelhardt <jengelh@inai.de>
+
+- Update to release 1.13.1
+  * Fixed a bug that could result in an incorrect result being
+    given for the `AutomorphismGroup` for a digraph that was
+    created by the `CompleteBipartiteDigraph` operation.
+
+-------------------------------------------------------------------
+Fri Sep 26 16:20:21 UTC 2025 - Jan Engelhardt <jengelh@inai.de>
+
+- Update to release 1.13.0
+  * EAPS 4.x support
+  * Improved the performance of `IsTwoEdgeTransitive`
+- Delete eaps4.patch (merged)
+
+-------------------------------------------------------------------
+Thu Sep 11 07:53:47 UTC 2025 - Jan Engelhardt <jengelh@inai.de>
+
+- Update to release 1.12.1
+  * Fix an inconsistency in ``IsConnectedDigraph`` for a digraph
+    with no vertices.
+  * Fixed incorrect properties getting set in ``CirculantGraph``.
+
+-------------------------------------------------------------------
+Sun Sep  7 16:05:48 UTC 2025 - Jan Engelhardt <jengelh@inai.de>
+
+- Update to release 1.12.0
+  * Added function `IsDirectedForest`
+
+-------------------------------------------------------------------
+Fri Aug 29 07:36:56 UTC 2025 - Jan Engelhardt <jengelh@inai.de>
+
+- Update to release 1.11.0
+  * Added functions `IsTwoEdgeTransitive`, `BurntPancakeGraph`,
+    `BurntPancakeGraph`, `MinimalCyclicEdgeCut`,
+    `DigraphAllChordlessCyclesOfMaximalLength`, `DigraphKings`,
+    `DigraphIsKing`, `DigraphMaximumFlow`,
+    `RandomUniqueEdgeWeightedDigraph`
+  * `RandomDigraph` is now more random
+  * Added a new optional first argument for mutability in
+    function `CayleyDigraph`
+  * Implemented Zykov's and Christofides's algorithms and made them
+    available as options for `ChromaticNumber`
+  * Sped up `OnDigraphs` for a digraph and a permutation
+  * Added dreadnaut support
+
+-------------------------------------------------------------------
+Wed Aug 27 18:43:23 UTC 2025 - Jan Engelhardt <jengelh@inai.de>
+
+- Update to release 1.10.1
+  * Fix a duplication bug in ArticulationPoints
+
+-------------------------------------------------------------------
+Thu Jul  3 09:19:43 UTC 2025 - Jan Engelhardt <jengelh@inai.de>
+
+- Add eaps4.patch
+
+-------------------------------------------------------------------
+Thu Feb 27 23:00:16 UTC 2025 - Jan Engelhardt <jengelh@inai.de>
+
+- Make specfile conform to POSIX sh
+
+-------------------------------------------------------------------
+Fri Feb 14 18:41:43 UTC 2025 - Jan Engelhardt <jengelh@inai.de>
+
+- Update to release 1.10.0
+  * Added copy in `DigraphAllChordlessCycles`
+  * Implementation of facial walks and dual graphs
+  * Added `IsOrderFilter` function
+  * Edge weights #4: shortest path(s)
+
 -------------------------------------------------------------------
 Sun Sep  8 07:46:45 UTC 2024 - Jan Engelhardt <jengelh@inai.de>
 

gap-digraphs.spec

@@ -1,7 +1,7 @@
 #
 # spec file for package gap-digraphs
 #
-# Copyright (c) 2024 SUSE LLC
+# Copyright (c) 2026 SUSE LLC and contributors
 #
 # All modifications and additions to the file contributed by third parties
 # remain the property of their copyright owners, unless otherwise agreed
@@ -17,7 +17,7 @@
 
 
 Name:           gap-digraphs
-Version:        1.9.0
+Version:        1.14.0
 Release:        0
 Summary:        GAP: Digraphs and multigraphs
 License:        GPL-3.0-or-later
@@ -25,17 +25,20 @@ Group:          Productivity/Scientific/Math
 URL:            https://digraphs.github.io/Digraphs/
 #Git-Clone:     https://github.com/digraphs/Digraphs
 Source:         https://github.com/digraphs/Digraphs/releases/download/v%version/digraphs-%version.tar.gz
-BuildRequires:  edge-addition-planarity-suite-devel
+BuildRequires:  autoconf
+BuildRequires:  automake
+BuildRequires:  edge-addition-planarity-suite-devel >= 4
 BuildRequires:  fdupes
 BuildRequires:  gap-devel
 BuildRequires:  gap-rpm-devel
 BuildRequires:  gcc-c++
 BuildRequires:  gmp-devel
+BuildRequires:  libtool
 Requires:       gap-core >= 4.10
 Requires:       gap-datastructures >= 0.2.5
 Requires:       gap-io >= 4.5.1
 Requires:       gap-orb >= 4.8.2
-Suggests:       gap-autodic >= 2022.08.11
+Suggests:       gap-autodoc >= 2020.08.11
 Suggests:       gap-gapdoc >= 1.6.3
 Suggests:       gap-grape >= 4.8.1
 Suggests:       gap-nautytracesinterface >= 0.2
@@ -47,24 +50,27 @@ The Digraphs package is a GAP package containing methods for digraphs
 and multidigraphs.
 
 %prep
-%autosetup -n digraphs-%version
+%autosetup -n digraphs-%version -p1
 
 %build
+if [ ! -e configure ]; then
+	ls -al
+	./autogen.sh
+fi
 %configure --with-gaproot="%gapdir" --without-intrinsics \
 	--with-external-planarity
 %make_build
 find . -type f -name "*~" -print -delete
 
 %install
-%gappkg_simple_install
-pushd "%buildroot/$fmoddir/"
-find . -type f -name .dirstamp -print -delete
-# delete tests and assets
-rm -Rf tst data/symmetric-closure.ds6.gz data/test-1.d6
 # delete sources and build artifacts, user is not expected to rebuild in distribution tree
 rm -Rf autom4te.cache src cnf config* m4 autogen.sh aclocal.m4 *.la Makefile*
 rm -Rf extern/edge* extern/bliss*/[a-z]* extern/bliss*/.deps extern/bliss*/.libs extern/bliss*/.clang*
-popd
+%gappkg_simple_install
+cd "%buildroot/$fmoddir/"
+find . -type f -name .dirstamp -print -delete
+# delete tests and assets
+rm -Rf tst data/symmetric-closure.ds6.gz data/test-1.d6
 %fdupes %buildroot/%_prefix
 
 %files -f %name.files