HugeAdjacency {fake} | R Documentation |
Simulation of undirected graph
Description
Simulates the adjacency matrix encoding an unweighted, undirected graph with no self-loops.
Usage
HugeAdjacency(pk = 10, topology = "random", nu = 0.1, ...)
Arguments
pk |
number of nodes. |
topology |
topology of the simulated graph. If using
|
nu |
expected density (number of edges over the number of node pairs) of
the graph. This argument is only used for |
... |
additional arguments to be passed to
|
Value
A symmetric adjacency matrix encoding an unweighted, undirected graph with no self-loops.
[Package fake version 1.4.0 Index]