add CHANGELOG

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

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 = "[email protected]", role = c("aut")), person("Viktor", "Petukhov", email = "[email protected]", role = c("aut")), person("V.A.", "Traag", email = "[email protected]", role = c("ctb")), person("Gábor", "Csárdi", email = "[email protected]", role = c("ctb")), person("Tamás", "Nepusz", email = "[email protected]", role = c("ctb")), person("Minh Van", "Nguyen", email = "[email protected]", role = c("ctb")), person("Evan", "Biederstedt", email = "[email protected]", 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: <https://github.com/vtraag/leidenalg>. 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) <doi:10.1038/s41598-019-41695-z>.
 License: GPL-3