From 19d8d5cfee17d57622000c84e052fe9c93e50675 Mon Sep 17 00:00:00 2001 From: Evan Biederstedt Date: Tue, 2 Mar 2021 21:11:42 -0500 Subject: [PATCH] add CHANGELOG --- CHANGELOG.md | 9 +++++++++ DESCRIPTION | 3 +-- 2 files changed, 10 insertions(+), 2 deletions(-) create mode 100644 CHANGELOG.md diff --git a/CHANGELOG.md b/CHANGELOG.md new file mode 100644 index 0000000..2a16b6e --- /dev/null +++ b/CHANGELOG.md @@ -0,0 +1,9 @@ +## [0.1.1] - 2021-03-02 + +* Fixed issue with unweighted graph. In this case, we set all edge weights to 1. + + +## [0.1.0] - 2020-11-11 + +* Version published on CRAN: https://cran.r-project.org/web/packages/leidenAlg/index.html +* Tagged version on github released on 2 Jan 2021: https://github.com/kharchenkolab/leidenAlg/releases/tag/0.1.0 \ No newline at end of file diff --git a/DESCRIPTION b/DESCRIPTION index ff94329..a88fc0f 100644 --- a/DESCRIPTION +++ b/DESCRIPTION @@ -1,8 +1,7 @@ Package: leidenAlg Type: Package Title: Implements the Leiden Algorithm via an R Interface -Version: 0.1.0 -Date: 2020-11-06 +Version: 0.1.1 Authors@R: c(person("Peter", "Kharchenko", email = "Peter_Kharchenko@hms.harvard.edu", role = c("aut")), person("Viktor", "Petukhov", email = "viktor.s.petukhov@ya.ru", role = c("aut")), person("V.A.", "Traag", email = "v.a.traag@cwts.leidenuniv.nl", role = c("ctb")), person("Gábor", "Csárdi", email = "sardi.gabor@gmail.com", role = c("ctb")), person("Tamás", "Nepusz", email = "ntamas@gmail.com", role = c("ctb")), person("Minh Van", "Nguyen", email = "nguyenminh2@gmail.com", role = c("ctb")), person("Evan", "Biederstedt", email = "evan.biederstedt@gmail.com", role=c("cre", "aut"))) Description: An R interface to the Leiden algorithm, an iterative community detection algorithm on networks. The algorithm is designed to converge to a partition in which all subsets of all communities are locally optimally assigned, yielding communities guaranteed to be connected. The implementation proves to be fast, scales well, and can be run on graphs of millions of nodes (as long as they can fit in memory). The original implementation was constructed as a python interface "leidenalg" found here: . The algorithm was originally described in Traag, V.A., Waltman, L. & van Eck, N.J. "From Louvain to Leiden: guaranteeing well-connected communities". Sci Rep 9, 5233 (2019) . License: GPL-3