add unit tests for max_comm_size #8

Author: TomKellyGenetics

NEWS.md

@@ -2,8 +2,12 @@
 
 * migrate to calling community_leiden in igraph
 
+# leiden 0.3.6
+
 * add methods for multiplex community detection from a list of graphs
 
+* add support for maximum community size (depends on leidenalg 0.8.2), if available
+
 # leiden 0.3.5
 
 * background changes to build vignettes on CRAN

tests/testthat/test_igraph.R

@@ -32,6 +32,19 @@ test_that("run with resolution parameter", {
   expect_length(partition, 100)
 })
 
+test_that("run with max_comm_size", {
+  skip_if_no_python()
+  partition <- leiden(snn_graph,
+                      partition_type = "ModularityVertexPartition",
+                      resolution_parameter = 0.2,
+                      max_comm_size = 8,
+                      degree_as_node_size = TRUE,
+                      seed = 9001)
+  expect_length(partition, length(V(snn_graph)))
+  expect_equal(sort(unique(partition)), 1:14)
+  expect_equal(max(table(partition)), 8)
+})
+
 test_that("run on igraph object with random seed", {
   skip_if_no_python()
   partition <- leiden(snn_graph, seed = 42L, weights = NULL)
@@ -66,6 +79,7 @@ test_that("run with named adjacency matrix", {
   partition <- leiden(snn_graph)
   expect_length(partition, 100)
 })
+<<<<<<< HEAD
 
 mat1 <- matrix(round(runif(10000, 0, 1)), 100, 100)
 mat2 <- matrix(round(rbinom(10000, 1, 0.1)), 100, 100)
@@ -192,3 +206,5 @@ test_that("run consistent results bewteen igraph and reticulate legacy mode with
 
 
 
+=======
+>>>>>>> 4dc48af... add unit tests for max_comm_size #8

tests/testthat/test_multiplex.R

@@ -245,3 +245,20 @@ test_that("run with ModularityVertexPartition multiplexed", {
                  1, 3, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 5, 5, 3, 3,
                  3, 1, 5, 3, 1, 1, 1, 1, 1, 1, 1, 5, 5, 5, 1, 1, 1, 5, 6, 5))
 })
+
+test_that("run with ModularityVertexPartition multiplexed and max_comm_size", {
+  skip_if_no_python()
+  partition <- leiden(multiplex_graph,
+                      partition_type = "ModularityVertexPartition",
+                      resolution_parameter = 0.1,
+                      max_comm_size = 8,
+                      degree_as_node_size = TRUE,
+                      seed = 9001)
+  expect_length(partition, length(V(multiplex_graph[[1]])))
+  expect_equal(sort(unique(partition)), 1:10)
+  expect_equal(max(table(partition)), 8)
+  expect_equal(partition,
+               c(4, 4, 2, 3, 8, 3, 3, 4, 2, 3, 3, 8, 8, 3, 3, 3, 6, 6, 5, 8,
+                 2, 8, 6, 7, 2, 5, 5, 5, 7, 5, 7, 7, 5, 5, 7, 5, 4, 1, 1, 4, 4,
+                 4, 2, 1, 4, 6, 6, 6, 6, 9, 2, 6, 1, 1, 1, 2, 2, 7, 1, 10, 1))
+})