plot.mcGP

Only applicable for bi-objective problems of class <code>mcGP</code>.
<code>plot.mcGP</code> generates a scatterplot of edge weights. If the nodes do
have coordinates, additionally a scatterplot of the nodes in the euclidean
plane is generated.

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

plot.mcGP function

<dl><dt>x</dt>
<dd>[<code>mcGP</code>] 
Multi-objective graph problem.</dd>
<dt>y</dt>
<dd>Not used at the moment.</dd>
<dt>show.cluster.centers</dt>
<dd>[<code>logical(1)</code>] 
Display cluster centers?
Default is <code>TRUE</code>. This option is ignored silently if the instance is not clustered.</dd>
<dt>...</dt>
<dd>[any] 
Not used at the moment.</dd></dl>

Arguments

Visualize bi-objective graph. — plot.mcGP

<dl>

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


<dt>y</dt>
<dd>Not used at the moment.</dd>


<dt>show.cluster.centers</dt>
<dd>[<code>logical(1)</code>] 
Display cluster centers?
Default is <code>TRUE</code>. This option is ignored silently if the instance is not clustered.</dd>


<dt>...</dt>
<dd>[any] 
Not used at the moment.</dd>

</dl>

plot.mcGP: Visualize bi-objective graph.

Description

Usage

Value

Arguments