mutUniformPruefer

<code>mutUniformPruefer</code> replaces each component of a Pruefer code of length n - 2
with probability <code>p</code> with a random node number between 1 and n.

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

mutUniformPruefer function

<dl><dt>ind</dt>
<dd>[<code>integer</code>] 
Pruefer code.</dd>
<dt>p</dt>
<dd>[<code>numeric(1)</code>] 
Probability of mutation of each component of <code>ind</code>.
Default is <code>1 / length(ind)</code>.</dd></dl>

Arguments

Uniform mutation for Pruefer code representation. — mutUniformPruefer

<dl>

<dt>ind</dt>
<dd>[<code>integer</code>] 
Pruefer code.</dd>


<dt>p</dt>
<dd>[<code>numeric(1)</code>] 
Probability of mutation of each component of <code>ind</code>.
Default is <code>1 / length(ind)</code>.</dd>

</dl>

mutUniformPruefer: Uniform mutation for Pruefer code representation.

Description

Usage

Value

Arguments

See Also