Description Usage Arguments Value
View source: R/solver_random.R
Solves the 3-GCP problem by generating random colorings
1 | solver_random(G, nfe, args)
|
G |
the graph to be solved, represented by a list where G$V is the number of nodes, and G$E is a |E|x2 edge matrix. |
nfe |
the number of function evaluations allowed |
args |
a list of arguments – none is used in this particular method |
a list containing the total number of violations of the best coloring, the best coloring (a V vector of 1:3) and the total number of evaluations spent
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.