9 May 2025   9:47:34.016 PM
 
tsp_brute():
  Fortran90 version
  Solve small traveling salesman problems by brute force.
 
  Enter the name of the file containing the city-to-city distance table
 
  Distance matrix:
 
       Col       1             2             3             4             5      
       Row
 
         1   0.00000       3.00000       4.00000       2.00000       9.00000    
         2   3.00000       0.00000       4.00000       6.00000       3.00000    
         3   4.00000       4.00000       0.00000       5.00000       8.00000    
         4   2.00000       6.00000       5.00000       0.00000       6.00000    
         5   9.00000       3.00000       8.00000       6.00000       0.00000    
 
  Itinerary:
  Step  From  To    Distance
 
     1     3   1     4.00000    
     2     1   4     2.00000    
     3     4   5     6.00000    
     4     5   2     3.00000    
     5     2   3     4.00000    
 
  Total:            19.0000    
 
  Number of paths checked =        120
 
  Minimum length =    19.0000    
  Average length =    25.0000    
  Maximum length =    31.0000    
 
tsp_brute():
  Normal end of execution.
 
 9 May 2025   9:47:34.017 PM