Description Usage Arguments Details Value Author(s) References See Also Examples

`randomNodeGraph`

generates a random graph with the specified
degree distribution. Self-loops are allowed. The resultant graph is
directed (but can always be coerced to be undirected).

1 | ```
randomNodeGraph(nodeDegree)
``` |

`nodeDegree` |
A named integer vector specifying the node degrees. |

The input vector must be named, the names are taken to be the names of the nodes. The sum must be even (there is a theorem that says we require that to construct a graph). Self-loops are allowed, although patches to the code that make this a switchable parameter would be welcome.

An instance of the `graphNEL`

class. The graph is directed.

R. Gentleman

Random Graphs as Models of Networks, M. E. J. Newman.

1 2 3 4 5 | ```
set.seed(123)
c1 <- c(a = 1, b = 1, c = 2, d = 4)
(g1 <- randomNodeGraph(c1))
stopifnot(validObject(g1))
``` |

```
Loading required package: BiocGenerics
Loading required package: parallel
Attaching package: 'BiocGenerics'
The following objects are masked from 'package:parallel':
clusterApply, clusterApplyLB, clusterCall, clusterEvalQ,
clusterExport, clusterMap, parApply, parCapply, parLapply,
parLapplyLB, parRapply, parSapply, parSapplyLB
The following objects are masked from 'package:stats':
IQR, mad, sd, var, xtabs
The following objects are masked from 'package:base':
Filter, Find, Map, Position, Reduce, anyDuplicated, append,
as.data.frame, cbind, colMeans, colSums, colnames, do.call,
duplicated, eval, evalq, get, grep, grepl, intersect, is.unsorted,
lapply, lengths, mapply, match, mget, order, paste, pmax, pmax.int,
pmin, pmin.int, rank, rbind, rowMeans, rowSums, rownames, sapply,
setdiff, sort, table, tapply, union, unique, unsplit, which,
which.max, which.min
A graphNEL graph with directed edges
Number of Nodes = 4
Number of Edges = 4
```

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.