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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
context("operators")
test_that("operators work", {
library(igraph)
o <- function(x) x[order(x[,1], x[,2]),]
g1 <- make_ring(10)
g2 <- make_star(11, center=11, mode="undirected")
gu <- union(g1, g2)
expect_that(vcount(gu), equals(11))
expect_that(ecount(gu), equals(20))
expect_that(o(rbind(as_edgelist(g1), as_edgelist(g2))),
equals(o(as_edgelist(gu))))
gdu <- disjoint_union(g1, g2)
expect_that(o(as_edgelist(gdu)),
equals(o(rbind(as_edgelist(g1),
as_edgelist(g2)+vcount(g1)))))
####
expect_that(graph.isomorphic(difference(gu, g1), g2), is_true())
####
expect_that(graph.isomorphic(intersection(gu, g2), g2), is_true())
expect_that(graph.isomorphic(intersection(gu, g1,
keep.all.vertices=FALSE),
g1),is_true())
####
x <- complementer(complementer(g2))
expect_true(identical_graphs(x, g2))
####
gc <- compose(gu, g1)
expect_that(vcount(gc), equals(11))
expect_that(ecount(gc), equals(60))
expect_that(diameter(gc), equals(2))
})
test_that("Union of directed named graphs", {
graphs <- list(
make_graph( ~1:2:3:4:5, 1-+2, 1-+3, 2-+3, 2-+4, 3-+4, 1-+5, 3-+5),
make_graph( ~1:2:3:4:5, 2-+3, 1-+4, 2-+4, 3-+4, 2-+5, 3-+5),
make_graph( ~1:2:3:4:5, 1-+2, 1-+3, 2-+4, 3-+4, 1-+5, 4-+5)
)
gg <- graph.union(graphs)
expect_equal(vcount(gg), 5)
expect_equal(ecount(gg), 10)
})
|
