File: test-minimum.spanning.tree.R

package info (click to toggle)
r-cran-igraph 2.2.2-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 27,772 kB
  • sloc: ansic: 206,420; cpp: 21,827; fortran: 4,090; yacc: 1,229; lex: 518; sh: 52; makefile: 8
file content (41 lines) | stat: -rw-r--r-- 928 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
test_that("mst works", {
  g <- graph_from_data_frame(
    data.frame(
      from = c(1, 1, 2, 2, 2, 3, 4),
      to = c(2, 3, 3, 4, 5, 5, 5),
      weight = c(1, 7, 5, 4, 3, 6, 2)
    ),
    directed = FALSE
  )
  mst_true <- graph_from_data_frame(
    data.frame(
      from = c(1, 2, 2, 4),
      to = c(2, 3, 5, 5),
      weight = c(1, 5, 3, 2)
    ),
    directed = FALSE
  )
  mst_g <- mst(g)
  expect_isomorphic(mst_g, mst_true)

  mst_g_prim <- mst(g, algorithm = "prim")
  expect_isomorphic(mst_g_prim, mst_true)

  mst_g_unweighted <- mst(g, algorithm = "unweighted")
  mst_true_unweighted <- graph_from_data_frame(
    data.frame(
      from = c(1, 1, 2, 2),
      to = c(2, 3, 4, 5)
    ),
    directed = FALSE
  )
  expect_isomorphic(mst_g_unweighted, mst_true_unweighted)
})

test_that("mst error works", {
  g <- sample_gnp(10, 0.4)
  expect_snapshot(
    mst(g, algorithm = "undefined"),
    error = TRUE
  )
})