graph_random: Generates a random, valid 3-GCP instance, without...
In caranha/EvoGCP: Evolutionary Computation Tools for the Graph Coloring Problem
Description
Usage
Arguments
Value
Examples
Description
Generates a random, valid 3-GCP instance, without connectivity guarantee
Usage
1
graph_random(N, density = 2)
Arguments
N
Integer - number of vertices in the graph.
density
0..1 - edge density in the graph.
Value
a list with two elements: V - number of nodes in the graph, and E - an edge list in the shape of a 2xE matrix. The
graph is guaranteed to have a valid 3-coloring, but not guaranteed to be connected.
Examples
1
generate_random(10,2)
caranha/EvoGCP documentation built on May 3, 2021, 3:40 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value Examples
Description
Generates a random, valid 3-GCP instance, without connectivity guarantee
Usage
1 | graph_random(N, density = 2)
|
Arguments
N |
Integer - number of vertices in the graph. |
density |
0..1 - edge density in the graph. |
Value
a list with two elements: V - number of nodes in the graph, and E - an edge list in the shape of a 2xE matrix. The graph is guaranteed to have a valid 3-coloring, but not guaranteed to be connected.
Examples
1 | generate_random(10,2)
|
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.