Skip to content

Commit 2c8d53f

Browse files
doc, readme edits
1 parent d989bfc commit 2c8d53f

File tree

5 files changed

+17
-9
lines changed

5 files changed

+17
-9
lines changed

CHANGELOG.md

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,10 @@
11
# Changelog
22

3+
## [1.1.2] - 2023 September 3
4+
* README changes, documentation changes
5+
36
## [1.1.1] - 2023 August 31
4-
* Yichen Wang (U. Michigan) added function `find_partition_with_rep_rcpp()`
7+
* Yichen Wang (U. Michigan) added functions `find_partition_with_rep()` and `find_partition_with_rep_rcpp()`
58

69
## [1.1.0] - 2023 July 1
710
* Fixed bugs due to release of igraph verison 1.5.0. Refer to https://github.com/kharchenkolab/leidenAlg/issues/13

DESCRIPTION

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,14 +1,14 @@
11
Package: leidenAlg
22
Type: Package
33
Title: Implements the Leiden Algorithm via an R Interface
4-
Version: 1.1.1
4+
Version: 1.1.2
55
Authors@R: c(person("Peter", "Kharchenko", email = "Peter_Kharchenko@hms.harvard.edu", role = c("aut")),
66
person("Viktor", "Petukhov", email = "viktor.s.petukhov@ya.ru", role = c("aut")),
7+
person("Yichen", "Wang", email = "wayichen@umich.edu", role=c("aut")),
78
person("V.A.", "Traag", email = "v.a.traag@cwts.leidenuniv.nl", role = c("ctb")),
89
person("Gábor", "Csárdi", email = "sardi.gabor@gmail.com", role = c("ctb")),
910
person("Tamás", "Nepusz", email = "ntamas@gmail.com", role = c("ctb")),
1011
person("Minh Van", "Nguyen", email = "nguyenminh2@gmail.com", role = c("ctb")),
11-
person("Yichen", "Wang", email = "wayichen@umich.edu", role=c("aut")),
1212
person("Evan", "Biederstedt", email = "evan.biederstedt@gmail.com", role=c("cre", "aut")))
1313
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>.
1414
License: GPL-3
@@ -34,5 +34,5 @@ RoxygenNote: 7.2.3
3434
URL: https://github.com/kharchenkolab/leidenAlg
3535
BugReports: https://github.com/kharchenkolab/leidenAlg/issues
3636
NeedsCompilation: yes
37-
Author: Peter Kharchenko [aut], Viktor Petukhov [aut], V.A. Traag [ctb], Gábor Csárdi [ctb], Tamás Nepusz [ctb], Minh Van Nguyen [ctb], Yichen Wang [aut], Evan Biederstedt [cre, aut]
37+
Author: Peter Kharchenko [aut], Viktor Petukhov [aut], Yichen Wang [aut], V.A. Traag [ctb], Gábor Csárdi [ctb], Tamás Nepusz [ctb], Minh Van Nguyen [ctb], Evan Biederstedt [cre, aut]
3838
Maintainer: Evan Biederstedt <evan.biederstedt@gmail.com>

R/communities.R

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@ NULL
1919

2020

2121
#' Leiden algorithm community detection
22-
#' Detect communities using Leiden algorithm (implementation copied from https://github.com/vtraag/leidenalg)
22+
#' Detects communities using Leiden algorithm (implementation copied from https://github.com/vtraag/leidenalg)
2323
#'
2424
#' @param graph graph on which communities should be detected
2525
#' @param resolution resolution parameter (default=1.0) - higher numbers lead to more communities

README.md

Lines changed: 7 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -70,19 +70,24 @@ brew install libxml2 glpk gmp
7070

7171
## Functions
7272

73-
* `leiden.community()`: Detect communities using Leiden algorithm, output as `fakeCommunities` class for downstream use.
73+
* `find_partition()`: Finds the optimal partition using the Leiden algorithm.
74+
75+
* `find_partition_with_rep()`: Finds the optimal partition using the Leiden algorithm with replicate starts
76+
77+
* `leiden.community()`: Detects communities using Leiden algorithm, output as `fakeCommunities` class for downstream use.
7478

7579
* `rleiden.community()`: Recursive leiden communities, constructs an n-step recursive clustering, using leiden.community.detection. Returns a `fakeCommunities` object that has methods membership(), without dendrogram.
7680

7781
* `as.dendrogram()`: Returns pre-calculated dendrogram from `"fakeCommunities"` object
7882

7983
* `membership()`: Returns pre-calculated membership factor from `"fakeCommunities"` object
8084

85+
8186
## Citation
8287
If you find `leidenAlg` useful for your publication, please cite:
8388

8489
```
8590
Peter Kharchenko, Viktor Petukhov, Yichen Wang, and Evan Biederstedt (2023).
8691
leidenAlg: Implements the Leiden Algorithm via an R Interface. R
87-
package version 1.1.1. https://github.com/kharchenkolab/leidenAlg
92+
package version 1.1.2. https://github.com/kharchenkolab/leidenAlg
8893
```

man/leiden.community.Rd

Lines changed: 2 additions & 2 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

0 commit comments

Comments
 (0)