Running ‘spelling.R’
  Running ‘testthat.R’ [34s/51s]
Running the tests in ‘tests/testthat.R’ failed.
Complete output:
  > library(testthat)
  > library(iGraphMatch)
  Thanks for using iGraphMatch!
  We'd love to get feedback on what you like, what you don't like,
  and how you are using the package.
  See ?iGraphMatch for contact information.
  > 
  > test_check("iGraphMatch")
  ══ Skipped tests ═══════════════════════════════════════════════════════════════
  • On CRAN (3)
  
  ══ Failed tests ════════════════════════════════════════════════════════════════
  ── Error (test-FW-hard-seeding.R:14:3): FW with no seed ────────────────────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. └─iGraphMatch::gm(A, B, seeds = NULL, method = "indefinite", start = "bari") test-FW-hard-seeding.R:14:2
   2.   └─iGraphMatch:::graph_match_indefinite(...)
   3.     ├─iGraphMatch::graphMatch(...)
   4.     └─iGraphMatch::graphMatch(...)
   5.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-FW-hard-seeding.R:19:3): FW with correct hard seeds ─────────────
  Error: Matrices must have same dimensions in diag2Tsmart(e1, e2, "d") + e2
  Backtrace:
       █
    1. └─iGraphMatch::gm(...) test-FW-hard-seeding.R:19:2
    2.   └─iGraphMatch:::graph_match_indefinite(...)
    3.     └─iGraphMatch:::get_s_to_ns(A, B, seeds, nonseeds, rp)
    4.       ├─s2ns + s_to_ns(Alist[[ch]], Blist[[ch]])
    5.       └─s2ns + s_to_ns(Alist[[ch]], Blist[[ch]])
    6.         ├─methods::callGeneric(diag2Tsmart(e1, e2, "d"), e2)
    7.         │ └─base::eval(call, parent.frame())
    8.         │   └─base::eval(call, parent.frame())
    9.         ├─diag2Tsmart(e1, e2, "d") + e2
   10.         └─diag2Tsmart(e1, e2, "d") + e2
   11.           └─Matrix:::dimCheck(e1, e2)
  ── Error (test-FW-hard-seeding.R:28:3): FW with incorrect hard seeds ───────────
  Error in `A[seeds$A, nonseeds$A]`: invalid or not-yet-implemented 'Matrix' subsetting
  Backtrace:
      █
   1. └─iGraphMatch::gm(...) test-FW-hard-seeding.R:28:2
   2.   └─iGraphMatch:::graph_match_indefinite(...)
   3.     └─iGraphMatch:::get_s_to_ns(A, B, seeds, nonseeds, rp)
   4.       └─iGraphMatch:::s_to_ns(Alist[[ch]], Blist[[ch]])
   5.         ├─A[seeds$A, nonseeds$A]
   6.         └─A[seeds$A, nonseeds$A]
  ── Error (test-FW-hard-seeding.R:45:3): FW multi-layer ─────────────────────────
  Error: Matrices must have same dimensions in diag2Tsmart(e1, e2, "d") + e2
  Backtrace:
       █
    1. └─iGraphMatch::gm(...) test-FW-hard-seeding.R:45:2
    2.   └─iGraphMatch:::graph_match_indefinite(...)
    3.     └─iGraphMatch:::get_s_to_ns(A, B, seeds, nonseeds, rp)
    4.       ├─s2ns + s_to_ns(Alist[[ch]], Blist[[ch]])
    5.       └─s2ns + s_to_ns(Alist[[ch]], Blist[[ch]])
    6.         ├─methods::callGeneric(diag2Tsmart(e1, e2, "d"), e2)
    7.         │ └─base::eval(call, parent.frame())
    8.         │   └─base::eval(call, parent.frame())
    9.         ├─diag2Tsmart(e1, e2, "d") + e2
   10.         └─diag2Tsmart(e1, e2, "d") + e2
   11.           └─Matrix:::dimCheck(e1, e2)
  ── Error (test-Isorank.R:15:3): isorank match with greedy LAP ──────────────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. └─iGraphMatch::gm(A, B, seeds, startm, method = "IsoRank", lap_method = "greedy") test-Isorank.R:15:2
   2.   └─iGraphMatch:::graph_match_IsoRank(A, B, seeds, similarity, ...)
   3.     ├─iGraphMatch::graphMatch(...)
   4.     └─iGraphMatch::graphMatch(...)
   5.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-Isorank.R:22:3): isorank match with hungarian lap ───────────────
  Error in `R %*% Matrix::t(rpmat)`: Cholmod error 'X and/or Y have wrong dimensions' at file ../MatrixOps/cholmod_sdmult.c, line 88
  Backtrace:
      █
   1. └─iGraphMatch::gm(A, B, seeds, startm, method = "IsoRank", lap_method = "LAP") test-Isorank.R:22:2
   2.   └─iGraphMatch:::graph_match_IsoRank(A, B, seeds, similarity, ...)
   3.     ├─R %*% Matrix::t(rpmat)
   4.     └─R %*% Matrix::t(rpmat)
  ── Error (test-Isorank.R:47:3): IsoRank multi-layer ────────────────────────────
  Error in `R %*% Matrix::t(rpmat)`: Cholmod error 'X and/or Y have wrong dimensions' at file ../MatrixOps/cholmod_sdmult.c, line 88
  Backtrace:
      █
   1. └─iGraphMatch::gm(A, B, seeds, startm, method = "IsoRank", lap_method = "LAP") test-Isorank.R:47:2
   2.   └─iGraphMatch:::graph_match_IsoRank(A, B, seeds, similarity, ...)
   3.     ├─R %*% Matrix::t(rpmat)
   4.     └─R %*% Matrix::t(rpmat)
  ── Error (test-best-match.R:9:1): (code run outside of `test_that()`) ──────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. └─iGraphMatch::gm(A, B, seeds, r = 3, method = "percolation") test-best-match.R:9:0
   2.   └─iGraphMatch:::graph_match_percolation(...)
   3.     ├─iGraphMatch::graphMatch(...)
   4.     └─iGraphMatch::graphMatch(...)
   5.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-check_sim.R:11:1): (code run outside of `test_that()`) ──────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. └─iGraphMatch::gm(A, B, start = "bari", sim = sim_rect, method = "indefinite") test-check_sim.R:11:0
   2.   └─iGraphMatch:::graph_match_indefinite(...)
   3.     ├─iGraphMatch::graphMatch(...)
   4.     └─iGraphMatch::graphMatch(...)
   5.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-convex.R:14:5): warning from gm convex ──────────────────────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
       █
    1. ├─testthat::expect_warning(...) test-convex.R:14:4
    2. │ └─testthat:::expect_condition_matching(...)
    3. │   └─testthat:::quasi_capture(...)
    4. │     ├─testthat:::.capture(...)
    5. │     │ └─base::withCallingHandlers(...)
    6. │     └─rlang::eval_bare(quo_get_expr(.quo), quo_get_env(.quo))
    7. └─iGraphMatch::gm(A, B, method = "convex")
    8.   └─iGraphMatch:::graph_match_convex(A, B, seeds, similarity, ...)
    9.     ├─iGraphMatch::graphMatch(...)
   10.     └─iGraphMatch::graphMatch(...)
   11.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-convex.R:29:5): matching correspondence between graph1 and graph2 ──
  Error in `eval_bare(expr, quo_get_env(quo))`: object 'actual' not found
  Backtrace:
      █
   1. └─testthat::expect_equal(dim(actual), c(igraph::vcount(A), igraph::vcount(B))) test-convex.R:29:4
   2.   └─testthat::quasi_label(enquo(object), label, arg = "object")
   3.     └─rlang::eval_bare(expr, quo_get_env(quo))
  ── Error (test-convex.R:33:3): doubly stochastic ───────────────────────────────
  Error in `h(simpleError(msg, call))`: error in evaluating the argument 'x' in selecting a method for function 'rowSums': object 'actual' not found
  Backtrace:
      █
   1. ├─testthat::expect_lt(sum(abs(rowSums(actual$soft) - 1)), 1e-05) test-convex.R:33:2
   2. │ └─testthat::quasi_label(enquo(object), label, arg = "object")
   3. │   └─rlang::eval_bare(expr, quo_get_env(quo))
   4. ├─methods:::rowSums(actual$soft)
   5. └─base::.handleSimpleError(...)
   6.   └─base:::h(simpleError(msg, call))
  ── Error (test-convex.R:37:3): number of seeds ─────────────────────────────────
  Error in `eval_bare(expr, quo_get_env(quo))`: object 'actual' not found
  Backtrace:
      █
   1. └─testthat::expect_equal(sum(actual$seeds), 0) test-convex.R:37:2
   2.   └─testthat::quasi_label(enquo(object), label, arg = "object")
   3.     └─rlang::eval_bare(expr, quo_get_env(quo))
  ── Error (test-gm_PATH.R:12:5): warning from gm convex ─────────────────────────
  Error in `h(simpleError(msg, call))`: error in evaluating the argument 'x' in selecting a method for function 'innerproduct': Cholmod error 'A and B inner dimensions must match' at file ../MatrixOps/cholmod_ssmult.c, line 80
  Backtrace:
       █
    1. ├─testthat::expect_warning(...) test-gm_PATH.R:12:4
    2. │ └─testthat:::expect_condition_matching(...)
    3. │   └─testthat:::quasi_capture(...)
    4. │     ├─testthat:::.capture(...)
    5. │     │ └─base::withCallingHandlers(...)
    6. │     └─rlang::eval_bare(quo_get_expr(.quo), quo_get_env(.quo))
    7. ├─iGraphMatch::gm(A, B, seeds, method = "PATH")
    8. │ └─iGraphMatch:::graph_match_PATH(A, B, seeds, similarity, ...)
    9. │   └─iGraphMatch:::graph_match_convex(...)
   10. │     ├─iGraphMatch::innerproduct(...)
   11. │     ├─Ann %*% P
   12. │     └─Ann %*% P
   13. │       ├─iGraphMatch::matrix_list(...)
   14. │       │ └─methods::new("matrix_list", ml)
   15. │       │   ├─methods::initialize(value, ...)
   16. │       │   └─methods::initialize(value, ...)
   17. │       └─base::lapply(seq_along(x), function(i) x[[i]] %*% y)
   18. │         └─iGraphMatch:::FUN(X[[i]], ...)
   19. │           ├─x[[i]] %*% y
   20. │           └─x[[i]] %*% y
   21. │             ├─methods::as(x %*% sx, "sparseMatrix")
   22. │             │ └─methods:::.class1(object)
   23. │             ├─x %*% sx
   24. │             └─x %*% sx
   25. └─base::.handleSimpleError(...)
   26.   └─base:::h(simpleError(msg, call))
  ── Error (test-gm_PATH.R:28:3): matching correspondence between graph1 and graph2 ──
  Error in `h(simpleError(msg, call))`: error in evaluating the argument 'x' in selecting a method for function 'innerproduct': Cholmod error 'A and B inner dimensions must match' at file ../MatrixOps/cholmod_ssmult.c, line 80
  Backtrace:
       █
    1. ├─testthat::expect_warning(...) test-gm_PATH.R:28:2
    2. │ └─testthat:::expect_condition_matching(...)
    3. │   └─testthat:::quasi_capture(...)
    4. │     ├─testthat:::.capture(...)
    5. │     │ └─base::withCallingHandlers(...)
    6. │     └─rlang::eval_bare(quo_get_expr(.quo), quo_get_env(.quo))
    7. ├─iGraphMatch::gm(A, B, seeds, method = "PATH")
    8. │ └─iGraphMatch:::graph_match_PATH(A, B, seeds, similarity, ...)
    9. │   └─iGraphMatch:::graph_match_convex(...)
   10. │     ├─iGraphMatch::innerproduct(...)
   11. │     ├─Ann %*% P
   12. │     └─Ann %*% P
   13. │       ├─iGraphMatch::matrix_list(...)
   14. │       │ └─methods::new("matrix_list", ml)
   15. │       │   ├─methods::initialize(value, ...)
   16. │       │   └─methods::initialize(value, ...)
   17. │       └─base::lapply(seq_along(x), function(i) x[[i]] %*% y)
   18. │         └─iGraphMatch:::FUN(X[[i]], ...)
   19. │           ├─x[[i]] %*% y
   20. │           └─x[[i]] %*% y
   21. │             ├─methods::as(x %*% sx, "sparseMatrix")
   22. │             │ └─methods:::.class1(object)
   23. │             ├─x %*% sx
   24. │             └─x %*% sx
   25. └─base::.handleSimpleError(...)
   26.   └─base:::h(simpleError(msg, call))
  ── Error (test-gm_expand_when_stuck.R:10:3): matching correspondence between graph1 and graph2 ──
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. └─iGraphMatch::gm(A, B, seeds, method = "percolation", r = 2, ExpandWhenStuck = TRUE) test-gm_expand_when_stuck.R:10:2
   2.   └─iGraphMatch:::graph_match_percolation(...)
   3.     ├─iGraphMatch::graphMatch(...)
   4.     └─iGraphMatch::graphMatch(...)
   5.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-gm_expand_when_stuck.R:15:3): test number of seeds ──────────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. ├─testthat::expect_equal(...) test-gm_expand_when_stuck.R:15:2
   2. │ └─testthat::quasi_label(enquo(object), label, arg = "object")
   3. │   └─rlang::eval_bare(expr, quo_get_env(quo))
   4. └─iGraphMatch::gm(A, B, seeds, method = "percolation", r = 2, ExpandWhenStuck = TRUE)
   5.   └─iGraphMatch:::graph_match_percolation(...)
   6.     ├─iGraphMatch::graphMatch(...)
   7.     └─iGraphMatch::graphMatch(...)
   8.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-gm_expand_when_stuck.R:24:3): exp w. similarity score ───────────
  Error in `replCmat4(x, i1 = if (iMi) 0:(di[1] - 1L) else .ind.prep2(i, 
      1, di, dn), i2 = if (jMi) 0:(di[2] - 1L) else .ind.prep2(j, 
      2, di, dn), iMi = iMi, jMi = jMi, value = value)`: number of items to replace is not a multiple of replacement length
  Backtrace:
       █
    1. └─iGraphMatch::gm(...) test-gm_expand_when_stuck.R:24:2
    2.   └─iGraphMatch:::graph_match_percolation(...)
    3.     ├─methods:::`[<-`(...)
    4.     └─Matrix:::`[<-`(...)
    5.       └─Matrix:::.local(x, i, j, ..., value)
    6.         ├─methods::callGeneric(x = x, i = i, j = j, value = c(value))
    7.         │ └─base::eval(call, parent.frame())
    8.         │   └─base::eval(call, parent.frame())
    9.         ├─methods:::`[<-`(x = x, i = i, j = j, value = c(value))
   10.         └─Matrix:::`[<-`(x = x, i = i, j = j, value = c(value))
   11.           ├─methods:::`[<-`(...)
   12.           └─Matrix:::`[<-`(...)
   13.             └─Matrix:::replCmat4(...)
  ── Error (test-gm_expand_when_stuck.R:33:3): exp w. similarity score & no seeds ──
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. └─iGraphMatch::gm(...) test-gm_expand_when_stuck.R:33:2
   2.   └─iGraphMatch:::graph_match_percolation(...)
   3.     ├─iGraphMatch::graphMatch(...)
   4.     └─iGraphMatch::graphMatch(...)
   5.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-gm_expand_when_stuck.R:43:3): perco w. similarity score ─────────
  Error in `replCmat4(x, i1 = if (iMi) 0:(di[1] - 1L) else .ind.prep2(i, 
      1, di, dn), i2 = if (jMi) 0:(di[2] - 1L) else .ind.prep2(j, 
      2, di, dn), iMi = iMi, jMi = jMi, value = value)`: number of items to replace is not a multiple of replacement length
  Backtrace:
       █
    1. └─iGraphMatch::gm(...) test-gm_expand_when_stuck.R:43:2
    2.   └─iGraphMatch:::graph_match_percolation(...)
    3.     ├─methods:::`[<-`(...)
    4.     └─Matrix:::`[<-`(...)
    5.       └─Matrix:::.local(x, i, j, ..., value)
    6.         ├─methods::callGeneric(x = x, i = i, j = j, value = c(value))
    7.         │ └─base::eval(call, parent.frame())
    8.         │   └─base::eval(call, parent.frame())
    9.         ├─methods:::`[<-`(x = x, i = i, j = j, value = c(value))
   10.         └─Matrix:::`[<-`(x = x, i = i, j = j, value = c(value))
   11.           ├─methods:::`[<-`(...)
   12.           └─Matrix:::`[<-`(...)
   13.             └─Matrix:::replCmat4(...)
  ── Error (test-gm_expand_when_stuck.R:59:3): perco w. similarity score ─────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. └─iGraphMatch::gm(...) test-gm_expand_when_stuck.R:59:2
   2.   └─iGraphMatch:::graph_match_percolation(...)
   3.     ├─iGraphMatch::graphMatch(...)
   4.     └─iGraphMatch::graphMatch(...)
   5.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-graph_match_class.R:12:3): graphMatch class functions ───────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. ├─base::suppressWarnings(m <- gm(g1, g2, start = "bari", method = "indefinite")) test-graph_match_class.R:12:2
   2. │ └─base::withCallingHandlers(...)
   3. └─iGraphMatch::gm(g1, g2, start = "bari", method = "indefinite")
   4.   └─iGraphMatch:::graph_match_indefinite(...)
   5.     ├─iGraphMatch::graphMatch(...)
   6.     └─iGraphMatch::graphMatch(...)
   7.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-init_start.R:12:1): (code run outside of `test_that()`) ─────────
  Error in `h(simpleError(msg, call))`: error in evaluating the argument 'x' in selecting a method for function 'splr': index larger than maximal 2
  Backtrace:
       █
    1. ├─base::suppressWarnings(...) test-init_start.R:12:0
    2. │ └─base::withCallingHandlers(...)
    3. ├─iGraphMatch::init_start(...)
    4. │ └─iGraphMatch::init_start("bari", nns, ns, soft_seeds, seeds)
    5. │   └─iGraphMatch:::add_soft_seeds(start, nns, ns, soft_seeds, seeds)
    6. │     ├─pad(start, nss)[reorderA, reorderB]
    7. │     └─pad(start, nss)[reorderA, reorderB]
    8. │       ├─iGraphMatch::splr(...)
    9. │       ├─x@x[i, j, ..., drop = FALSE]
   10. │       └─x@x[i, j, ..., drop = FALSE]
   11. │         └─Matrix:::subCsp_ij(x, i, j, drop = drop)
   12. │           └─Matrix:::intI(i, n = d[1], dn[[1]], give.dn = FALSE)
   13. │             └─base::stop(gettextf("index larger than maximal %d", n), domain = NA)
   14. └─base::.handleSimpleError(...)
   15.   └─base:::h(simpleError(msg, call))
  ── Error (test-measure-func.R:8:1): (code run outside of `test_that()`) ────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. └─iGraphMatch::gm(g1, g2, method = "indefinite", start = "bari") test-measure-func.R:8:0
   2.   └─iGraphMatch:::graph_match_indefinite(...)
   3.     ├─iGraphMatch::graphMatch(...)
   4.     └─iGraphMatch::graphMatch(...)
   5.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-perco.R:11:3): perco of same sizes ──────────────────────────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. └─iGraphMatch::gm(A, B, seeds, method = "percolation", ExpandWhenStuck = FALSE) test-perco.R:11:2
   2.   └─iGraphMatch:::graph_match_percolation(...)
   3.     ├─iGraphMatch::graphMatch(...)
   4.     └─iGraphMatch::graphMatch(...)
   5.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-perco.R:19:3): perco w. similarity score ────────────────────────
  Error in `replCmat4(x, i1 = if (iMi) 0:(di[1] - 1L) else .ind.prep2(i, 
      1, di, dn), i2 = if (jMi) 0:(di[2] - 1L) else .ind.prep2(j, 
      2, di, dn), iMi = iMi, jMi = jMi, value = value)`: number of items to replace is not a multiple of replacement length
  Backtrace:
       █
    1. └─iGraphMatch::gm(...) test-perco.R:19:2
    2.   └─iGraphMatch:::graph_match_percolation(...)
    3.     ├─methods:::`[<-`(...)
    4.     └─Matrix:::`[<-`(...)
    5.       └─Matrix:::.local(x, i, j, ..., value)
    6.         ├─methods::callGeneric(x = x, i = i, j = j, value = c(value))
    7.         │ └─base::eval(call, parent.frame())
    8.         │   └─base::eval(call, parent.frame())
    9.         ├─methods:::`[<-`(x = x, i = i, j = j, value = c(value))
   10.         └─Matrix:::`[<-`(x = x, i = i, j = j, value = c(value))
   11.           ├─methods:::`[<-`(...)
   12.           └─Matrix:::`[<-`(...)
   13.             └─Matrix:::replCmat4(...)
  ── Error (test-perco.R:25:3): percolation without seeds ────────────────────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. └─iGraphMatch::gm(...) test-perco.R:25:2
   2.   └─iGraphMatch:::graph_match_percolation(...)
   3.     ├─iGraphMatch::graphMatch(...)
   4.     └─iGraphMatch::graphMatch(...)
   5.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Error (test-perco.R:37:3): perco w. directed graphs ─────────────────────────
  Error in `replCmat4(x, i1 = if (iMi) 0:(di[1] - 1L) else .ind.prep2(i, 
      1, di, dn), i2 = if (jMi) 0:(di[2] - 1L) else .ind.prep2(j, 
      2, di, dn), iMi = iMi, jMi = jMi, value = value)`: number of items to replace is not a multiple of replacement length
  Backtrace:
       █
    1. └─iGraphMatch::gm(...) test-perco.R:37:2
    2.   └─iGraphMatch:::graph_match_percolation(...)
    3.     ├─methods:::`[<-`(...)
    4.     └─Matrix:::`[<-`(...)
    5.       └─Matrix:::.local(x, i, j, ..., value)
    6.         ├─methods::callGeneric(x = x, i = i, j = j, value = c(value))
    7.         │ └─base::eval(call, parent.frame())
    8.         │   └─base::eval(call, parent.frame())
    9.         ├─methods:::`[<-`(x = x, i = i, j = j, value = c(value))
   10.         └─Matrix:::`[<-`(x = x, i = i, j = j, value = c(value))
   11.           ├─methods:::`[<-`(...)
   12.           └─Matrix:::`[<-`(...)
   13.             └─Matrix:::replCmat4(...)
  ── Error (test-perco.R:50:3): percolation multi-layer ──────────────────────────
  Error in `seeds[seed_g1] <- TRUE`: invalid subscript type 'list'
  Backtrace:
      █
   1. └─iGraphMatch::gm(A, B, seeds, method = "percolation", ExpandWhenStuck = FALSE) test-perco.R:50:2
   2.   └─iGraphMatch:::graph_match_percolation(...)
   3.     ├─iGraphMatch::graphMatch(...)
   4.     └─iGraphMatch::graphMatch(...)
   5.       └─iGraphMatch::check_seeds(gm$seeds, max(nnodes), logical = TRUE)
  ── Failure (test-seeds.R:26:3): example in documentation ───────────────────────
  check_seeds(as.data.frame(matrix(1:4, 2)), nv = 10)$seeds (`actual`) not equal to data.frame(A = c(1, 2), B = c(3, 4)) (`expected`).
  
  `actual` is length 4
  `expected` is length 2
  
  `names(actual)`:   "A.V1" "A.V2" "B.V1" "B.V2"
  `names(expected)`: "A"    "B"                 
  
  `actual$A.V1` is an integer vector (1, 2)
  `expected$A.V1` is absent
  
  `actual$A.V2` is an integer vector (3, 4)
  `expected$A.V2` is absent
  
  `actual$B.V1` is an integer vector (1, 2)
  `expected$B.V1` is absent
  
  `actual$B.V2` is an integer vector (3, 4)
  `expected$B.V2` is absent
  
  `actual$A` is absent
  `expected$A` is a double vector (1, 2)
  
  `actual$B` is absent
  `expected$B` is a double vector (3, 4)
  ── Error (test-umeyama.R:16:3): matching correspondence between graph1 and graph2 ──
  Error in `Grad + Matrix::t(similarity)`: non-conformable arrays
  Backtrace:
      █
   1. └─iGraphMatch::gm(A, B, seeds, startm, method = "Umeyama") test-umeyama.R:16:2
   2.   └─iGraphMatch:::graph_match_Umeyama(A, B, seeds, similarity)
  ── Error (test-umeyama.R:33:3): matching correspondence between graph1 and graph2 for directed graphs ──
  Error in `Grad + Matrix::t(similarity)`: non-conformable arrays
  Backtrace:
      █
   1. └─iGraphMatch::gm(A, B, seeds, startm, method = "Umeyama") test-umeyama.R:33:2
   2.   └─iGraphMatch:::graph_match_Umeyama(A, B, seeds, similarity)
  ── Error (test-umeyama.R:50:3): Umeyama multi-layer ────────────────────────────
  Error: Matrices must have same dimensions in e1 + diag2Tsmart(e2, e1, "d")
  Backtrace:
       █
    1. └─iGraphMatch::gm(A, B, seeds, method = "Umeyama") test-umeyama.R:50:2
    2.   └─iGraphMatch:::graph_match_Umeyama(A, B, seeds, similarity)
    3.     ├─Grad + Matrix::t(similarity)
    4.     └─Grad + Matrix::t(similarity)
    5.       ├─methods::callGeneric(Matrix(e1), e2)
    6.       │ └─base::eval(call, parent.frame())
    7.       │   └─base::eval(call, parent.frame())
    8.       ├─Matrix(e1) + e2
    9.       └─Matrix(e1) + e2
   10.         ├─methods::callGeneric(e1, diag2Tsmart(e2, e1, "d"))
   11.         │ └─base::eval(call, parent.frame())
   12.         │   └─base::eval(call, parent.frame())
   13.         ├─e1 + diag2Tsmart(e2, e1, "d")
   14.         └─e1 + diag2Tsmart(e2, e1, "d")
   15.           └─Matrix:::dimCheck(e1, e2)
  
  [ FAIL 33 | WARN 0 | SKIP 3 | PASS 106 ]
  Error: Test failures
  Execution halted