getRandomSpanningTree

Given a <code>grapherator</code> object this function
returns a random spanning tree. The tree generation process is a simple heuristic:
A random weight from a \(U(0, 1)\)-distribution is assigned to each edge of the
graph. Next, a spanning tree is computed by <code>spantree</code>.

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

getRandomSpanningTree function

<dl><dt>graph</dt>
<dd>[<code>grapherator</code>] 
Graph.</dd></dl>

Arguments

Generate random spanning tree. — getRandomSpanningTree

<dl>

<dt>graph</dt>
<dd>[<code>grapherator</code>] 
Graph.</dd>

</dl>

getRandomSpanningTree: Generate random spanning tree.

Description

Usage

Value

Arguments

Examples