Research Article
Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six
Algorithm 3
Disjoint paths sets between vertices.
| procedure | | set the neighbors of each vertex for current | | for Each do | | | | function RECURSIVE | | if then wrong length | | return | | if then has already been visited | | return No paths to | | if then destination reached | | single vertex in path | | return single path in the set | | | for to do | | neighbor of | | | for Each path in do | | concatenate paths | | aggregate path | | | return | | function | | for Each path set of paths do may have huge # of iterations | | | for Each internal vertex of do | | if then | | next | | | | return |
|