graph_culberson_equipartite: Equipartite Graph (+IID) Source:...
In caranha/EvoGCP: Evolutionary Computation Tools for the Graph Coloring Problem
Description
Usage
Arguments
Details
Value
Examples
View source: R/graph_culberson.R
Description
The algorithm is defined in 3 steps:
Usage
1
graph_culberson_equipartite(N, probability = 1)
Arguments
N
Integer - number of vertices in the graph.
probability
0..1 - edge's probability.
Details
1- Create a permutation of nodes
1- Create 3 groups with N/3 nodes
2- Assign edges by the IID method
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
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 Details Value Examples
View source: R/graph_culberson.R
Description
The algorithm is defined in 3 steps:
Usage
1 | graph_culberson_equipartite(N, probability = 1)
|
Arguments
N |
Integer - number of vertices in the graph. |
probability |
0..1 - edge's probability. |
Details
1- Create a permutation of nodes 1- Create 3 groups with N/3 nodes 2- Assign edges by the IID method
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 |
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.