ffa.heuristical_swap: Heuristical Swap (step2)
In caranha/EvoGCP: Evolutionary Computation Tools for the Graph Coloring Problem
Description
Usage
Arguments
Details
Value
Description
Swaps an uncolored vertex with the vertex that has highest saturation degree
if tie, choose randomly
Usage
1
ffa.heuristical_swap(p, w, v, satur)
Arguments
p
vector of colors
w
vector of weights
v
the uncolored vertex which will be swapped
satur
vector of saturation degrees
Details
Steps:
1. get the first uncolored vertex
2. sort the predecessors according to the saturation degree descending
3. swap the uncolored vertex with the vertex that has highest saturation degree, if tie, choose randomly (from the tie set)
Value
a permutation of w
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
Description
Swaps an uncolored vertex with the vertex that has highest saturation degree if tie, choose randomly
Usage
1 | ffa.heuristical_swap(p, w, v, satur)
|
Arguments
p |
vector of colors |
w |
vector of weights |
v |
the uncolored vertex which will be swapped |
satur |
vector of saturation degrees |
Details
Steps: 1. get the first uncolored vertex 2. sort the predecessors according to the saturation degree descending 3. swap the uncolored vertex with the vertex that has highest saturation degree, if tie, choose randomly (from the tie set)
Value
a permutation of w
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.