Skip to contents

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

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

Author

C.B. Hurley and R.W. Oldford

Examples

  
require(PairViz)
d <- dist(rnorm(5))
g <- mk_complete_graph(d)