# mutSubforestMST: Forest-mutator for edge list representation. In jakobbossek/rmoco: A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem

## Description

mutForestMST drops k edges randomly. In consequence the tree is decomposed into k+1 subtrees (forest). Now the operator reconnects the subtrees by constructing a minimum spanning tree between the components.

## Usage

 1 2 mutSubforestMST(ind, sigma = ncol(ind), scalarize = FALSE, instance = NULL) 

## Arguments

 ind [matrix(2, m)] Matrix of edges (each column is one edge). sigma [integer()] Upper bound for number of dropped edges. scalarize [logical(1)] Should a scalarized version of the the subproblem be solved? If TRUE, a random weight λ \in [0,1] is sampled from a U[0, 1]-distribution. Next, a weighted sum scalarization λ \cdot c_1 + (1 - λ) \cdot c_2 of the subproblem is solved. Default is FALSE, i.e., the single-objective subproblem is solved. The objective to optimize for is sampled with equal probability. instance [grapherator] Multi-objective graph.

## Value

[matrix(2, m)] Mutated edge list.

Evolutionary multi-objective algorithm mcMSTEmoaBG
Other mcMST EMOA mutators: mutEdgeExchange, mutKEdgeExchange, mutSubgraphMST, mutUniformPruefer