Research Article
Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six
Algorithm 2
Coloring fitness function.
function | | for Each vertex pair in the Graph do | | Accumulate the product | return | function | | for Each InternallyDisjointPathsSet of pair do | | if then | Select best fitness | return | function | | for Each Path in do | | Accumulate the product | return | function | | return | function | | for Each Step in do | | if not then count colors only once | | mark color as already used | return |
|