Journal of Applied Mathematics

Research Article

Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance

Table 1

Iteration process of Algorithm 16.
IN IN
1 13 13        
10 14 Yes 6 12 11 No
11 11         
2 13 13     13 13   
10 14 Yes 7 13 14 Yes
11 11     11 11   
3 14 13 No 8 15 13 No
4
13 13         
11 14 Yes 9 15 13 No
11 11        
5 13 13         
11 14 Yes      
11 11         
IN: the number of iterations; : edge obtained in step 3; : the distance of the shortest path under ; LW: can be changed to ?