plotEdges

Given a list of characteristic vectors (graphs) the function plots
an embedding of the nodes in the Euclidean plane and depicts an edge if and
only if it is contained in at least one of the graphs. The edge thickness
indicates the number of graphs the edge is part of.

Algorithms to approximate the Pareto-front of multi-criteria minimum spanning tree problems.

Jakob Bossek

mcMST

A Toolbox for the Multi-Criteria Minimum Spanning Tree Problem

plotEdges function

<dl><dt>x</dt>
<dd>[<code>list</code>] 
List of characteristic vectors.</dd>
<dt>n</dt>
<dd>[<code>integer(1)</code>] 
Number of nodes of the problem instance.
Default is <code>sqrt(length(cv))</code> where cv is the first component of
<code>x</code>.</dd>
<dt>normalize</dt>
<dd>[<code>logical(1)</code>] 
Shall edge frequencies be plotted? Default is code TRUE.</dd>
<dt>...</dt>
<dd>[any] 
Further arguments passed down to <code>qgraph</code>.</dd></dl>

Arguments

Visualize edges common to several solutions. — plotEdges

<dl>

<dt>x</dt>
<dd>[<code>list</code>] 
List of characteristic vectors.</dd>


<dt>n</dt>
<dd>[<code>integer(1)</code>] 
Number of nodes of the problem instance.
Default is <code>sqrt(length(cv))</code> where cv is the first component of
<code>x</code>.</dd>


<dt>normalize</dt>
<dd>[<code>logical(1)</code>] 
Shall edge frequencies be plotted? Default is code TRUE.</dd>


<dt>...</dt>
<dd>[any] 
Further arguments passed down to <code>qgraph</code>.</dd>

</dl>

plotEdges: Visualize edges common to several solutions.

Description

Usage

Value

Arguments

See Also