update tests for multiplex graphs

Author: TomKellyGenetics

R/find_partition.R

@@ -296,7 +296,7 @@ seed = NULL,
 n_iterations = 2L,
 max_comm_size = 0L,
 degree_as_node_size = TRUE,
-legacy = FALSE
+legacy = TRUE
 ) {
   # disable printing numerals in scientific notation
   oo <- options(scipen = 100000000000)

tests/testthat/test_multiplex.R

@@ -215,7 +215,7 @@ skip_if_no_python <- function() {
     testthat::skip("leidenalg not available for testing")
 }
 
-
+set.seed(9000)
 test_that("run with CPMVertexPartition multiplexed", {
   skip_if_no_python()
   partition <- leiden(multiplex_graph,
@@ -227,11 +227,12 @@ test_that("run with CPMVertexPartition multiplexed", {
   expect_equal(partition,
                c(8, 2, 7, 5, 2, 5, 1, 2, 6, 5, 5, 2, 2, 5, 5, 5, 3, 6, 1, 2,
                  7, 10, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 4, 2,
-                 2, 2, 6, 4, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 6, 7, 6, 4, 9, 4
+                 2, 2, 6, 4, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 3, 7, 6, 4, 9, 4
                ))
   multiplex_graph
 })
 
+set.seed(9000)
 test_that("run with ModularityVertexPartition multiplexed", {
   skip_if_no_python()
   partition <- leiden(multiplex_graph,
@@ -241,12 +242,17 @@ test_that("run with ModularityVertexPartition multiplexed", {
                       seed = 9001)
   expect_length(partition, length(V(multiplex_graph[[1]])))
   expect_equal(sort(unique(partition)), 1:6)
+  expect_equal(table(partition),
+               structure(c(`1` = 15L, `2` = 13L, `3` = 13L, `4` = 11L, `5` = 8L,
+                           `6` = 1L), .Dim = 6L, .Dimnames = list(partition = c("1", "2",
+                           "3", "4", "5", "6")), class = "table"))
   expect_equal(partition,
-               c(3, 3, 1, 4, 3, 4, 4, 3, 1, 4, 4, 3, 3, 4, 4, 4, 1, 1, 2, 3,
-                 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))
+               c(4, 2, 4, 4, 2, 4, 4, 2, 1, 4, 4, 2, 2, 4, 4, 4, 1, 1, 3, 2,
+                 2, 2, 1, 3, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 5, 5, 2, 2,
+                 2, 1, 5, 2, 1, 1, 1, 1, 1, 1, 1, 5, 5, 5, 1, 4, 1, 5, 6, 5))
 })
 
+set.seed(9000)
 test_that("run with ModularityVertexPartition multiplexed and max_comm_size", {
   skip_if_no_python()
   partition <- leiden(multiplex_graph,
@@ -258,8 +264,9 @@ test_that("run with ModularityVertexPartition multiplexed and max_comm_size", {
   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))
+  expect_equal(table(partition),
+               structure(c(`1` = 8L, `2` = 8L, `3` = 8L, `4` = 8L, `5` = 8L,
+                           `6` = 8L, `7` = 6L, `8` = 5L, `9` = 1L, `10` = 1L), .Dim = 10L, .Dimnames = list(
+                             partition = c("1", "2", "3", "4", "5", "6", "7", "8", "9",
+                                           "10")), class = "table"))
 })