PlanarColoring

Checks if a graph is planar and returns the coloring of the graph

Allows easy access to the LEMON Graph Library set of algorithms, written in C++.
See the LEMON project page at <https://lemon.cs.elte.hu/trac/lemon>.
Current LEMON version is 1.3.1.

Josh Errickson

rlemon

R Access to LEMON Graph Algorithms

Arav Agarwal

Aditya Tewari

PlanarColoring function

<dl><dt>arcSources</dt>
<dd>Vector corresponding to the source nodes of a graph's
edges</dd>
<dt>arcTargets</dt>
<dd>Vector corresponding to the destination nodes of a graph's
edges</dd>
<dt>numNodes</dt>
<dd>The number of nodes in the graph</dd>
<dt>algorithm, </dt>
<dd>the algorithm to use. "sixColoring" generates a 6-coloring
of the graph, while "fiveColoring" generates a 5-coloring. Default is
"fiveColoring".</dd></dl>

Arguments

Solver for Planar Coloring — PlanarColoring

<dl>

<dt>arcSources</dt>
<dd>Vector corresponding to the source nodes of a graph's
edges</dd>


<dt>arcTargets</dt>
<dd>Vector corresponding to the destination nodes of a graph's
edges</dd>


<dt>numNodes</dt>
<dd>The number of nodes in the graph</dd>


<dt>algorithm, </dt>
<dd>the algorithm to use. "sixColoring" generates a 6-coloring
of the graph, while "fiveColoring" generates a 5-coloring. Default is
"fiveColoring".</dd>

</dl>

PlanarColoring: Solver for Planar Coloring

Description

Usage

Value

Arguments

Details