Create a neighbors list where every element is related to every other element.
This creates a complete graph.
Arguments
- n_elements
the number of observations to create a neighbors list for
- diag
default FALSE
. If TRUE
, includes diagonal element / the self.
Value
A neighbors list representing a complete graph.