/usr/lib/R/site-library/igraph/tests/test_indexing.R is in r-cran-igraph 0.7.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 | context("Indexing")
mm <- function(...) {
v <- as.numeric(as.vector(list(...)))
matrix(v, nrow=sqrt(length(v)))
}
am <- function(x) {
x <- as.matrix(x)
dimnames(x) <- NULL
x
}
library(igraph)
library(Matrix, quietly=TRUE, warn.conflicts=FALSE)
g <- graph.tree(20)
test_that("[ indexing works", {
## Are these vertices connected?
expect_that(g[1,2], equals(1))
expect_that(am(g[c(1,1,7), c(2,3,14)]), equals(mm(1,1,0, 1,1,0, 0,0,1)))
expect_that(am(g[c(1,1,7), c(5,3,12)]), equals(mm(0,0,0, 1,1,0 ,0,0,0)))
expect_that(am(g[c(1,1,1,1), c(2,3,2,2)]), equals(matrix(1, 4, 4)))
expect_that(am(g[c(8,17), c(17,8)]), equals(mm(1,0, 0,0)))
})
V(g)$name <- letters[1:vcount(g)]
test_that("[ indexing works with symbolic names", {
## The same with symbolic names
expect_that(g['a','b'], equals(1))
expect_that(am(g[c('a','a','g'), c('b','c','n')]),
equals(mm(1,1,0, 1,1,0, 0,0,1)))
expect_that(am(g[c('a','a','g'), c('e','c','l')]),
equals(mm(0,0,0, 1,1,0, 0,0,0)))
expect_that(am(g[c('a','a','a','a'), c('b','c','b','b')]),
equals(matrix(1, 4, 4)))
expect_that(am(g[c('h','q'), c('q','h')]), equals(mm(1,0, 0,0)))
})
test_that("[ indexing works with logical vectors", {
## Logical vectors
lres <- structure(c(0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0), .Dim = c(2L, 20L),
.Dimnames = list(c("b", "c"), c("a", "b", "c",
"d", "e", "f", "g", "h", "i", "j", "k", "l",
"m", "n", "o", "p", "q", "r", "s", "t")))
expect_that(g[degree(g,mode="in")==0,2], equals(1))
expect_that(as.matrix(g[2:3,TRUE]), equals(lres))
})
test_that("[ indexing works with negative indices", {
## Negative indices
nres <- structure(c(0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0), .Dim = c(2L, 19L),
.Dimnames=list(c("b", "c"),
c("b", "c", "d", "e", "f", "g", "h", "i", "j",
"k", "l", "m", "n", "o", "p", "q", "r", "s",
"t")))
expect_that(as.matrix(g[2:3,-1]), equals(nres))
})
el <- get.edgelist(g, names=FALSE)
E(g)$weight <- el[,1] * el[,2]
test_that("[ indexing works with weighted graphs", {
## Weighted graphs
expect_that(g[1,2], equals(2))
expect_that(am(g[c(1,1,7), c(2,3,14)]), equals(mm(2,2,0, 3,3,0, 0,0,98)))
expect_that(am(g[c(1,1,7), c(5,3,12)]), equals(mm(0,0,0, 3,3,0, 0,0,0)))
expect_that(am(g[c(1,1,1,1), c(2,3,2,2)]),
equals(mm(2,2,2,2, 3,3,3,3, 2,2,2,2, 2,2,2,2)))
expect_that(am(g[c(8,17), c(17,8)]), equals(mm(136,0, 0,0)))
})
test_that("[ indexing works with weighted graphs and symbolic names",
{
## Weighted graph, with symbolic names
expect_that(g['a','b'], equals(2))
expect_that(am(g[c('a','a','g'), c('b','c','n')]),
equals(mm(2,2,0, 3,3,0, 0,0,98)))
expect_that(am(g[c('a','a','g'), c('e','c','l')]),
equals(mm(0,0,0, 3,3,0, 0,0,0)))
expect_that(am(g[c('a','a','a','a'), c('b','c','b','b')]),
equals(mm(2,2,2,2, 3,3,3,3, 2,2,2,2, 2,2,2,2)))
expect_that(am(g[c('h','q'), c('q','h')]), equals(mm(136,0, 0,0)))
})
################################################################
test_that("[[ indexing works", {
## Adjacent vertices
expect_that(g[[1, ]], equals(list(a=2:3)))
expect_that(g[[, 2]], equals(list(b=1)))
expect_that(g[[, 2, directed=FALSE]], equals(list(b=c(1,4,5))))
expect_that(g[[2, directed=FALSE]], equals(list(b=c(1,4,5))))
expect_that(g[[1:3, ]], equals(list(a=2:3, b=4:5, c=6:7)))
expect_that(g[[, 1:3]], equals(list(a=numeric(), b=1, c=1)))
})
test_that("[[ indexing works with symbolic names", {
## Same with vertex names
expect_that(g[['a', ]], equals(list(a=2:3)))
expect_that(g[[, 'b']], equals(list(b=1)))
expect_that(g[[, 'b', directed=FALSE]], equals(list(b=c(1,4,5))))
expect_that(g[['b', directed=FALSE]], equals(list(b=c(1,4,5))))
expect_that(g[[letters[1:3],]], equals(list(a=2:3, b=4:5, c=6:7)))
expect_that(g[[, letters[1:3]]], equals(list(a=numeric(), b=1, c=1)))
})
test_that("[[ indexing works with logical vectors", {
## Logical vectors
expect_that(g[[degree(g,mode="in")==0,]], equals(list(a=2:3)))
})
test_that("[[ indexing works with filtering on both ends", {
## Filtering on both ends
expect_that(g[[1:10, 1:10]], equals(list(a=2:3, b=4:5, c=6:7, d=8:9,
e=10, f=numeric(),
g=numeric(), h=numeric(),
i=numeric(), j=numeric())))
})
################################################################
test_that("[ can query edge ids", {
## Query edge ids
expect_that(g[1,2, edges=TRUE], equals(1))
expect_that(am(g[c(1,1,7), c(2,3,14), edges=TRUE]),
equals(mm(1,1,0, 2,2,0, 0,0,13)))
expect_that(am(g[c(1,1,7), c(5,3,12), edges=TRUE]),
equals(mm(0,0,0, 2,2,0, 0,0,0)))
expect_that(am(g[c(1,1,1,1), c(2,3,2,2), edges=TRUE]),
equals(mm(1,1,1,1, 2,2,2,2, 1,1,1,1, 1,1,1,1)))
expect_that(am(g[c(8,17), c(17,8), edges=TRUE]),
equals(mm(16,0, 0,0)))
})
test_that("[ can query edge ids with symbolic names", {
## The same with symbolic names
expect_that(g['a','b', edges=TRUE], equals(1))
expect_that(am(g[c('a','a','g'), c('b','c','n'), edges=TRUE]),
equals(mm(1,1,0, 2,2,0, 0,0,13)))
expect_that(am(g[c('a','a','g'), c('e','c','l'), edges=TRUE]),
equals(mm(0,0,0, 2,2,0, 0,0,0)))
expect_that(am(g[c('a','a','a','a'), c('b','c','b','b'), edges=TRUE]),
equals(mm(1,1,1,1, 2,2,2,2, 1,1,1,1, 1,1,1,1)))
expect_that(am(g[c('h','q'), c('q','h'), edges=TRUE]),
equals(mm(16,0 ,0,0)))
})
################################################################
test_that("[[ can query incident edges", {
## Incident edges of vertices
expect_that(g[[1, , edges=TRUE]], equals(list(a=1:2)))
expect_that(g[[, 2, edges=TRUE]], equals(list(b=1)))
expect_that(g[[, 2, directed=FALSE, edges=TRUE]],
equals(list(b=c(3,4,1))))
expect_that(g[[2, directed=FALSE, edges=TRUE]], equals(list(b=c(3,4,1))))
expect_that(g[[1:3, , edges=TRUE]], equals(list(a=1:2, b=3:4, c=5:6)))
expect_that(g[[, 1:3, edges=TRUE]], equals(list(a=numeric(), b=1, c=2)))
})
test_that("[[ queries edges with vertex names", {
## Same with vertex names
expect_that(g[['a', , edges=TRUE]], equals(list(a=1:2)))
expect_that(g[[, 'b', edges=TRUE]], equals(list(b=1)))
expect_that(g[[, 'b', directed=FALSE, edges=TRUE]],
equals(list(b=c(3,4,1))))
expect_that(g[['b', directed=FALSE, edges=TRUE]],
equals(list(b=c(3,4,1))))
expect_that(g[[letters[1:3],, edges=TRUE]],
equals(list(a=1:2, b=3:4, c=5:6)))
expect_that(g[[, letters[1:3], edges=TRUE]],
equals(list(a=numeric(), b=1, c=2)))
## Filtering on both ends
expect_that(g[[1:10, 1:10, edges=TRUE]],
equals(list(1:2, 3:4, 5:6, 7:8, 9, numeric(), numeric(),
numeric(), numeric(), numeric())))
})
#################################################################
test_that("[ handles from and to properly", {
## from & to
g <- graph.tree(20)
expect_that(g[from=c(1,2,2,3), to=c(3,4,8,7)], equals(c(1,1,0,1)))
V(g)$name <- letters[1:20]
expect_that(g[from=c("a","b","b","c"), to=c("c","d","h","g")],
equals(c(1,1,0,1)))
E(g)$weight <- (1:ecount(g)) ^ 2
expect_that(g[from=c("a","b","b","c"), to=c("c","d","h","g")],
equals(c(4,9,0,36)))
expect_that(g[from=c("a","b","b","c"), to=c("c","d","h","g"),
edges=TRUE], equals(c(2,3,0,6)))
})
|