Description Usage Arguments Details Value Examples
View source: R/graph_culberson.R
The algorithm is defined in 3 steps:
1 | graph_culberson_equipartite(N, probability = 1)
|
N |
Integer - number of vertices in the graph. |
probability |
0..1 - edge's probability. |
1- Create a permutation of nodes 1- Create 3 groups with N/3 nodes 2- Assign edges by the IID method
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.
1 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.