erdos_list: Adjacency list version of undirected Erdos-Renyi random graph
In tjtnew/graphr: Random Graph Generation
Description
Usage
Arguments
Details
Value
Examples
Description
erdos_list creates an adjacency list representation of an
undirected Erdos-Renyi random graph.
Usage
1
erdos_list(N, avk)
Arguments
N
Number of vertices / nodes in the network.
avk
desired average degree of the network
Details
This functon generates an undirected random graph of size N, each node
having average degree avk. Self and repeated edges are not permitted
so if avk > (N - 1) a fully connected network will always be returned.
Value
adjacency list representation of the resultant network
Examples
1
gr <- erdos_list(1000,10)
tjtnew/graphr documentation built on May 19, 2019, 9:38 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Details Value Examples
Description
erdos_list creates an adjacency list representation of an
undirected Erdos-Renyi random graph.
Usage
1 | erdos_list(N, avk)
|
Arguments
N |
Number of vertices / nodes in the network. |
avk |
desired average degree of the network |
Details
This functon generates an undirected random graph of size N, each node
having average degree avk. Self and repeated edges are not permitted
so if avk > (N - 1) a fully connected network will always be returned.
Value
adjacency list representation of the resultant network
Examples
1 | gr <- erdos_list(1000,10)
|
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
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.