graph_minton: Generates a 3-GCP instance following the algorithm described...
In caranha/EvoGCP: Evolutionary Computation Tools for the Graph Coloring Problem
Description
Usage
Arguments
Details
Value
Examples
Description
S. Minton, M. Johnston, A. Philips, P. Laird, "Minimizing Conflicts: a heuristic repair method
for constraint satisfaction and scheduling problems", Artificial Intelligence, v.58 pp.161-205, 1992
Usage
1
graph_minton(N, density = 2)
Arguments
N
Integer - number of vertices in the graph.
density
0..1 - edge density in the graph.
Details
The algorithm is defined in three steps:
1- Create 3 groups with N/3 nodes
2- Create E edges between the groups randomly
3- Accept if the graph has no unconnected components
Value
a list of pair arrays representing edges in the graph. The graph is simple and undirected.
Examples
1
generate_minton(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 Details Value Examples
Description
S. Minton, M. Johnston, A. Philips, P. Laird, "Minimizing Conflicts: a heuristic repair method for constraint satisfaction and scheduling problems", Artificial Intelligence, v.58 pp.161-205, 1992
Usage
1 | graph_minton(N, density = 2)
|
Arguments
N |
Integer - number of vertices in the graph. |
density |
0..1 - edge density in the graph. |
Details
The algorithm is defined in three steps:
1- Create 3 groups with N/3 nodes 2- Create E edges between the groups randomly 3- Accept if the graph has no unconnected components
Value
a list of pair arrays representing edges in the graph. The graph is simple and undirected.
Examples
1 | generate_minton(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.