mk_complete_graph

Constructs a complete graph, actually an instance of <code>graph-NEL</code>

graphs

Improving graphics by ameliorating order effects, using Eulerian tours
and Hamiltonian decompositions of graphs. References for the methods presented
here are C.B. Hurley and R.W. Oldford (2010) <doi:10.1198/jcgs.2010.09136> and
C.B. Hurley and R.W. Oldford (2011) <doi:10.1007/s00180-011-0229-5>.

Catherine Hurley

PairViz

Visualization using Graph Traversal

mk_complete_graph function

<dl> <dt>d</dt>
<dd>an integer vector of length 1 which specified the number of nodes, a character vector of nodes names, a <code>dist</code>, or a symmetric matrix, either of which specify the nodes and edge weights.</dd></dl>

Arguments

Author

Constructs a complete graph. — mk_complete_graph

<dl>

 <dt>d</dt>
<dd>an integer vector of length 1 which specified the number of nodes, a character vector of nodes names, a <code>dist</code>, or a symmetric matrix, either of which specify the nodes and edge weights.</dd>

</dl>

mk_complete_graph: Constructs a complete graph.

Description

Usage

Value

Arguments

Author

Examples