28 July 2026   8:15:45.338 AM

tsp_nearest_test():
  Fortran90 version
  Test tsp_nearest(), which seeks a shortest round trip
  for the traveling salesperson problem, by starting at
  an arbitrary city, and always moving next to the nearest
  unvisited city.
  Route starting at city  1 has cost    40526.4    
  Route starting at city  2 has cost    39236.9    
  Route starting at city 42 has cost    39236.9    
 
  The final path:
 
City        X         Y
  42 1916.0000 1569.0000
  10 1112.0000 2049.0000
  24 1633.0000 2809.0000
  45   10.0000 2676.0000
  35   23.0000 2216.0000
  26  675.0000 1006.0000
   4  401.0000  841.0000
   2 2233.0000   10.0000
  29 3177.0000  756.0000
   5 3082.0000 1644.0000
  48 3023.0000 1942.0000
  39 3484.0000 2829.0000
  32 3245.0000 3305.0000
  21 4483.0000 3369.0000
  47 5185.0000 3258.0000
  11 5468.0000 2606.0000
  23 5199.0000 2182.0000
  14 4612.0000 2035.0000
  25 4307.0000 2322.0000
  13 4706.0000 2674.0000
  12 5989.0000 2873.0000
  15 6347.0000 2683.0000
  33 6426.0000 3173.0000
  46 6807.0000 2993.0000
  44 7509.0000 3239.0000
  18 7462.0000 3590.0000
   7 7573.0000 3716.0000
  28 7541.0000 3981.0000
  36 7248.0000 3779.0000
  30 7352.0000 4506.0000
   6 7608.0000 4458.0000
  37 7762.0000 4595.0000
  19 7732.0000 4723.0000
  27 7555.0000 4819.0000
  43 7280.0000 4899.0000
  17 7611.0000 5184.0000
  20 5900.0000 3561.0000
  40 6271.0000 2135.0000
   9 6898.0000 1885.0000
   1 6734.0000 1453.0000
   8 7265.0000 1268.0000
  38 7392.0000 2244.0000
  31 7545.0000 2801.0000
  22 6101.0000 1110.0000
  16 6107.0000  669.0000
   3 5530.0000 1424.0000
  34 4608.0000 1198.0000
  41 4985.0000  140.0000

  Cost of path =    39236.9    
  Created data file "att48_data.txt".
  Created command file "att48_commands.txt".

tsp_nearest_test():
  Normal end of execution.

28 July 2026   8:15:45.339 AM