tests/testthat/test-MinCostArboresence.R

In rlemon: R Access to LEMON Graph Algorithms

# Title            : Minimum Cost Arborescense
# File             : R/minimumspanningtree.R
# Exported         : MinCostArborescence
# Valid Algorithms : "MinCostArborescence" (default)
# Runners          : MinCostArborescenceRunner

# 1) Ensure runner functions run without error and return the "expected
# objects".
test_that("min cost arborescense runner", {

  s <- c(1, 2, 3, 4, 5, 6)
  t <- c(2, 3, 4, 5, 6, 1)
  d <- c(1, 10, 3, 2, 0, 8)

  out <- MinCostArborescenceRunner(s, t, d, 1, 6)
  expect_true(is.list(out))
  expect_length(out, 3)
  expect_equal(length(out[[1]]), length(out[[2]]))
  expect_length(out[[3]], 1)
})

test_that("min cost arborescense functions", {
  s <- c(1, 2, 3, 4, 5, 6)
  t <- c(2, 3, 4, 5, 6, 1)
  d <- c(1, 10, 3, 2, 0, 8)

  # 2) Ensure exported functions run without error and return the "expected
  # objects".
  out <- MinCostArborescence(s, t, d, 1, 6)
  expect_true(is.list(out))
  expect_length(out, 3)
  expect_equal(length(out[[1]]), length(out[[2]]))
  expect_length(out[[3]], 1)
  expect_named(out, c("sources", "targets", "cost"))

  # 3) Ensure exported functions with `algorithm=`default runs without error, and
  # returns the same if passed no argument
  out2 <- MinCostArborescence(s, t, d, 1, 6, algorithm = "MinCostArborescence")
  expect_identical(out, out2)

  # 4) Ensure exported functions work with all valid algorithms.
  # No alternate algorithsm

  # 5) Ensure exported functions fail if passed an invalid algorithm.
  expect_error(MinCostArborescence(s, t, d, 1, 6, algorithm = "abc"),
               "Invalid")
  expect_error(MinCostArborescence(s, t, d, 1, 6, algorithm = 1),
               "must be a string")
  expect_error(MinCostArborescence(s, t, d, 1, 6, algorithm = NULL),
               "must be a string")
})