Methods for dealing with sparse geometry binary predicate lists

Methods for dealing with sparse geometry binary predicate lists

# S3 method for sgbp
print(x, ..., n = 10, max_nb = 10)

# S3 method for sgbp
t(x)

# S3 method for sgbp
as.matrix(x, ...)

# S3 method for sgbp
dim(x)

Arguments

x	object of class sgbp
...	ignored
n	integer; maximum number of items to print
max_nb	integer; maximum number of neighbours to print for each item

Details

sgbp are sparse matrices, stored as a list with integer vectors holding the ordered TRUE indices of each row. This means that for a dense, \(m \times n\) matrix Q and a list L, if Q[i,j] is TRUE then \(j\) is an element of L[[i]]. Reversed: when \(k\) is the value of L[[i]][j], then Q[i,k] is TRUE.