diff options
| -rw-r--r-- | gnu/packages/graph.scm | 30 | ||||
| -rw-r--r-- | gnu/packages/maths.scm | 30 |
2 files changed, 31 insertions, 29 deletions
diff --git a/gnu/packages/graph.scm b/gnu/packages/graph.scm index 36d0467175..abcb659456 100644 --- a/gnu/packages/graph.scm +++ b/gnu/packages/graph.scm @@ -3,6 +3,7 @@ ;;; Copyright © 2018 Joshua Sierles, Nextjournal <joshua@nextjournal.com> ;;; Copyright © 2018 Tobias Geerinckx-Rice <me@tobias.gr> ;;; Copyright © 2019 Efraim Flashner <efraim@flashner.co.il> +;;; Copyright © 2019 Andreas Enge <andreas@enge.fr> ;;; ;;; This file is part of GNU Guix. ;;; @@ -31,6 +32,7 @@ #:use-module ((guix licenses) #:prefix license:) #:use-module (gnu packages) #:use-module (gnu packages gcc) + #:use-module (gnu packages autotools) #:use-module (gnu packages bioconductor) #:use-module (gnu packages bioinformatics) #:use-module (gnu packages check) @@ -446,3 +448,31 @@ they can fit in memory). The core function is @code{find_partition} which finds the optimal partition using the Leiden algorithm, which is an extension of the Louvain algorithm, for a number of different methods.") (license license:gpl3+))) + +(define-public edge-addition-planarity-suite + (package + (name "edge-addition-planarity-suite") + (version "3.0.0.5") + (source + (origin + (method git-fetch) + (uri (git-reference + (url (string-append "https://github.com/graph-algorithms/" + name)) + (commit (string-append "Version_" version)))) + (file-name (git-file-name name version)) + (sha256 + (base32 + "01cm7ay1njkfsdnmnvh5zwc7wg7x189hq1vbfhh9p3ihrbnmqzh8")))) + (build-system gnu-build-system) + (native-inputs + `(("autoconf" ,autoconf) + ("automake" ,automake) + ("libtool" ,libtool))) + (synopsis "Embedding of planar graphs") + (description "The package provides a reference implementation of the +linear time edge addition algorithm for embedding planar graphs and +isolating planarity obstructions.") + (license license:bsd-3) + (home-page + "https://github.com/graph-algorithms/edge-addition-planarity-suite"))) diff --git a/gnu/packages/maths.scm b/gnu/packages/maths.scm index b4e4067101..6d8fb9cec5 100644 --- a/gnu/packages/maths.scm +++ b/gnu/packages/maths.scm @@ -1,5 +1,5 @@ ;;; GNU Guix --- Functional package management for GNU -;;; Copyright © 2013, 2014, 2015, 2016, 2019 Andreas Enge <andreas@enge.fr> +;;; Copyright © 2013, 2014, 2015, 2016 Andreas Enge <andreas@enge.fr> ;;; Copyright © 2013 Nikita Karetnikov <nikita@karetnikov.org> ;;; Copyright © 2014, 2016, 2017 John Darrington <jmd@gnu.org> ;;; Copyright © 2014, 2015, 2016, 2017, 2018, 2019 Eric Bavier <bavier@member.fsf.org> @@ -5003,31 +5003,3 @@ command-line tools, and an Application Programming Interface (API). This package provides the static libraries required to run programs compiled against the nauty library.") (license license:asl2.0))) - -(define-public edge-addition-planarity-suite - (package - (name "edge-addition-planarity-suite") - (version "3.0.0.5") - (source - (origin - (method git-fetch) - (uri (git-reference - (url (string-append "https://github.com/graph-algorithms/" - name)) - (commit (string-append "Version_" version)))) - (file-name (git-file-name name version)) - (sha256 - (base32 - "01cm7ay1njkfsdnmnvh5zwc7wg7x189hq1vbfhh9p3ihrbnmqzh8")))) - (build-system gnu-build-system) - (native-inputs - `(("autoconf" ,autoconf) - ("automake" ,automake) - ("libtool" ,libtool))) - (synopsis "Embedding of planar graphs") - (description "The package provides a reference implementation of the -linear time edge addition algorithm for embedding planar graphs and -isolating planarity obstructions.") - (license license:bsd-3) - (home-page - "https://github.com/graph-algorithms/edge-addition-planarity-suite"))) |