|
Algorithm 2 Generate the mimic transformation sequence. |
-
Require:
The Mimic Transformation Graph
-
Ensure:
The Mimic Transformation Sequence S
-
1:
Create an empty Transformation Hops Matrix M;
-
2:
fori in N do
-
3:
for j in N do
-
4:
The number of hops for the shortest path from to
-
5:
appends to ;
-
6:
for; t > 0; do
-
7:
for each in M do
-
8:
if < t then
-
9:
-
10:
else
-
11:
-
12:
if There exists a Hamiltonian path in M then
-
13:
return Hamiltonian path in sequence
-
14:
return Null
|