rgraph_ws
.
ring_lattice(n, k, undirected = FALSE)
dgCMatrix
of size
$n * n$.
undirected=TRUE
, the degree of each node always
even. So if k=3
, then the degree will be 2
.
permute_graph
,
rdiffnet
, rewire_graph
,
rgraph_ba
, rgraph_er
,
rgraph_ws