mutSubgraphMST

<code>mutSubgraphMST</code> selects a random edge e = (u, v) and traverses
the tree starting form u and v respectively until a connected subtree of at most
<code>sigma</code> edges is selected. Then the subtree is replaced with the optimal spanning subtree
regarding one of the objectives with equal probability.

Algorithms to approximate the Pareto-front of multi-criteria minimum spanning tree problems. Additionally, a modular toolbox for the generation of multi-objective benchmark graph problems is included.

Jakob Bossek

mcMST

A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem

mutSubgraphMST function

<dl><dt>ind</dt>
<dd>[<code>matrix(2, m)</code>] 
Matrix of edges (each column is one edge).</dd>
<dt>sigma</dt>
<dd>[<code><a href="/link/integer()?package=mcMST&version=1.0.1" data-mini-rdoc="mcMST::integer()">integer()</a></code>] 
Upper bound for the size of the selected subtree.</dd>
<dt>instance</dt>
<dd>[<code>mcGP</code>] 
Multi-objective graph problem.</dd></dl>

Arguments

Subgraph-mutator for edge list representation. — mutSubgraphMST

<dl>

<dt>ind</dt>
<dd>[<code>matrix(2, m)</code>] 
Matrix of edges (each column is one edge).</dd>


<dt>sigma</dt>
<dd>[<code><a href='https://rdrr.io/r/base/integer.html'>integer()</a></code>] 
Upper bound for the size of the selected subtree.</dd>


<dt>instance</dt>
<dd>[<code>mcGP</code>] 
Multi-objective graph problem.</dd>

</dl>

mutSubgraphMST: Subgraph-mutator for edge list representation.

Description

Usage

Value

Arguments

See Also