Simulates the adjacency matrix encoding an unweighted, undirected graph with no self-loops.
HugeAdjacency(pk = 10, topology = "random", nu = 0.1, ...)A symmetric adjacency matrix encoding an unweighted, undirected graph with no self-loops.
number of nodes.
topology of the simulated graph. If using
implementation=HugeAdjacency, possible values are listed for the
argument graph of huge.generator. These are:
"random", "hub", "cluster", "band" and "scale-free".
expected density (number of edges over the number of node pairs) of
the graph. This argument is only used for topology="random" or
topology="cluster" (see argument prob in
huge.generator).
additional arguments to be passed to
huge.generator.