genRandomSpanningTree

Generate a random spanning tree of a graph
given the number of nodes of the problem instance.

Algorithms to approximate the Pareto-front of multi-criteria minimum spanning tree problems.

Jakob Bossek

mcMST

A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem

genRandomSpanningTree function

<dl><dt>n</dt>
<dd>[<code>integer</code>] 
Number of nodes of the problem.</dd>
<dt>type</dt>
<dd>[<code>character(1)</code>] 
String representing the desired format of the generated
spanning tree. Possible values are &#8220;pruefer&#8221; (Pruefer-code),
&#8220;edgelist&#8221; and &#8220;charvec&#8221; (characteristic vector).
Default is &#8220;pruefer&#8221;.</dd></dl>

Arguments

Generate a random spanning tree. — genRandomSpanningTree

<dl>

<dt>n</dt>
<dd>[<code>integer</code>] 
Number of nodes of the problem.</dd>


<dt>type</dt>
<dd>[<code>character(1)</code>] 
String representing the desired format of the generated
spanning tree. Possible values are &#8220;pruefer&#8221; (Pruefer-code),
&#8220;edgelist&#8221; and &#8220;charvec&#8221; (characteristic vector).
Default is &#8220;pruefer&#8221;.</dd>

</dl>

genRandomSpanningTree: Generate a random spanning tree.

Description

Usage

Value

Arguments

Examples