# mk_complete_graph

From PairViz v1.3.2
by Catherine Hurley

##### Constructs a complete graph.

Constructs a complete graph, actually an instance of `graph-NEL`

- Keywords
- graphs

##### Usage

`mk_complete_graph(d)`

##### Arguments

- d
an integer vector of length 1 which specified the number of nodes, a character vector of nodes names, a

`dist`

, or a symmetric matrix, either of which specify the nodes and edge weights.

##### Value

- a `graph-NEL`

##### Examples

```
# NOT RUN {
require(PairViz)
d <- dist(rnorm(5))
g <- mk_complete_graph(d)
# }
```

*Documentation reproduced from package PairViz, version 1.3.2, License: GPL-2*

### Community examples

Looks like there are no examples yet.