similarity: Similarity
In caranha/EvoGCP: Evolutionary Computation Tools for the Graph Coloring Problem
Description
Calculate the hamming distance-based similarity between two
(sets of) coloring candidates.
Usage
1
similarity(x1, x2)
Details
Led d be the number of positions with different colors between
coloring x1 and x2, then the similarity between x1 and x2 is
given by:
1 - d / (length of x)
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
Calculate the hamming distance-based similarity between two (sets of) coloring candidates.
Usage
1 | similarity(x1, x2)
|
Details
Led d be the number of positions with different colors between coloring x1 and x2, then the similarity between x1 and x2 is given by:
1 - d / (length of x)
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.