version 0.3.1

Author: larskuhtz

CHANGELOG.md

@@ -1,11 +1,18 @@
 # Revision history for digraph
 
+## 0.3.1 -- 2023-03-31
+
+* Add some degree-diameter graphs to the list of known graphs. These graphs
+  represent the best currently known solutions for the respective degree and
+  diameter. In concrete the graphs `d3k4`, `d4k3`, `d4k4`, `d5k3`, and `d5k4`
+  have been added.
+
 ## 0.3.0 -- 2023-02-03
 
-* Fix `fromAdjacencySets` and to preserve edge direction. This affects
-  the functions for computing shortest paths, distance, and diameter. These
-  functions now return correct results for directed graphs. Before these
-  functions silently turned the input into an undirected graph. (Contributed by
+* Fix `fromAdjacencySets` to preserve edge direction. This affects the functions
+  for computing shortest paths, distance, and diameter. These functions now
+  return correct results for directed graphs. Before these functions silently
+  turned the input into an undirected graph. (Contributed by
   [Geometer1729](https://github.com/Geometer1729))
 
 * Add `pentagon` and `ascendingCube` to the list of known graphs.

digraph.cabal

@@ -1,6 +1,6 @@
 cabal-version: 2.4
 name: digraph
-version: 0.3.0
+version: 0.3.1
 synopsis: Directed Graphs
 description: Directed graphs implementation that is based on unordered-containers
 homepage: https://github.com/kadena-io/digraph
@@ -9,7 +9,7 @@ license: BSD-3-Clause
 license-file: LICENSE
 author: Lars Kuhtz
 maintainer: [email protected]
-copyright: Copyright (c) 2019 - 2023, Kadena LLC
+copyright: Copyright (c) 2019 - 2025, Kadena LLC
 category: Data, Mathematics
 tested-with:
     GHC==9.12