mutEdgeExchange

Each edge is replaced with another feasible edge with probability p.
By default p = 1/m where m is the number of edges, i.e., in expectation one edge
is replaced. The operators maintains the spanning tree property, i.e., the resulting
edge list is indeed the edge list of a spanning tree.

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

mutEdgeExchange function

<dl><dt>ind</dt>
<dd>[<code>matrix(2, m)</code>] 
Matrix of edges (each column is one edge).</dd>
<dt>p</dt>
<dd>[<code>numeric(1)</code>] 
Probability of edge exchange.
Default is <code>1 / ncol(ind)</code>.</dd></dl>

Arguments

One-edge-exchange mutator for edge list representation of spanning trees. — mutEdgeExchange

<dl>

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


<dt>p</dt>
<dd>[<code>numeric(1)</code>] 
Probability of edge exchange.
Default is <code>1 / ncol(ind)</code>.</dd>

</dl>

mutEdgeExchange: One-edge-exchange mutator for edge list representation of spanning trees.

Description

Usage

Value

Arguments

See Also