Description Usage Arguments Details

Methods for dealing with sparse geometry binary predicate lists

1 2 3 4 5 6 7 8 9 10 11 |

`x` |
object of class |

`...` |
ignored |

`n` |
integer; maximum number of items to print |

`max_nb` |
integer; maximum number of neighbours to print for each item |

`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 x 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`

.

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.