# include <cmath>
# include <cstdlib>
# include <cstring>
# include <ctime>
# include <fstream>
# include <iomanip>
# include <iostream>

using namespace std;

# include "tsp_nearest.hpp"

int main ( );
void timestamp ( );
void tsp_display ( string prefix, int n, double *x2 );

//****************************************************************************80

int main ( )

//****************************************************************************80
//
//  Purpose:
//
//    tsp_nearest_test() tests tsp_nearest().
//
//  Licensing:
//
//    This code is distributed under the MIT license.
//
//  Modified:
//
//    14 July 2026
//
//  Author:
//
//    John Burkardt
//
{
  double cost;
  double d;
  int i;
  int i1;
  int i2;
  int j1;
  int j2;
  int n = 48;
  int order[48];
  string prefix = "att48";
  static double x[48*2] = {
     6734, 1453, 
    2233,   10, 
    5530, 1424, 
     401,  841, 
    3082, 1644, 
    7608, 4458, 
    7573, 3716, 
    7265, 1268, 
    6898, 1885, 
    1112, 2049, 
    5468, 2606, 
    5989, 2873, 
    4706, 2674, 
    4612, 2035, 
    6347, 2683, 
    6107,  669, 
    7611, 5184, 
    7462, 3590, 
    7732, 4723, 
    5900, 3561, 
    4483, 3369, 
    6101, 1110, 
    5199, 2182, 
    1633, 2809, 
    4307, 2322, 
     675, 1006, 
    7555, 4819, 
    7541, 3981, 
    3177,  756, 
    7352, 4506, 
    7545, 2801, 
    3245, 3305, 
    6426, 3173, 
    4608, 1198, 
      23, 2216, 
    7248, 3779, 
    7762, 4595, 
    7392, 2244, 
    3484, 2829, 
    6271, 2135, 
    4985,  140, 
    1916, 1569, 
    7280, 4899, 
    7509, 3239, 
      10, 2676, 
    6807, 2993, 
    5185, 3258, 
    3023, 1942 };
  double *x2;

  timestamp ( );
  cout << "\n";
  cout << "tsp_nearest_test():\n";
  cout << "  C++ version\n";
  cout << "  Test tsp_nearest(),, which uses the nearest neighbor method\n";
  cout << "  to construct a round trip for the traveling salesman problem.\n";

  tsp_nearest ( n, x, order, cost );

  cout << "Order:";
  for ( i = 0; i < n; i++ )
  {
    cout << "  " << order[i];
  }
  cout << "\n";
//
//  Report.
//
  printf ( "\n" );
  printf ( "  The best itinerary found:\n" );
  printf ( "\n" );
  printf ( "  Step  From  To        Distance\n" );
  printf ( "\n" );

  for ( i1 = 0; i1 < n; i1++ )
  {
    i2 = ( ( i1 + 1 ) % n );
    j1 = order[i1];
    j2 = order[i2];
    d = sqrt ( pow ( x[j1*2]   - x[j2*2],   2 )
             + pow ( x[j1*2+1] - x[j2*2+1], 2 ) );
    printf ( "  %4d    %2d  %2d  %14.6g\n", i1, j1, j2, d );
    cost = cost + d;
  }
  printf ( "  ----    --  --  --------------\n" );
  printf ( "  cost:           %14.6g\n", cost );
//
//  Display final path.
//
  x2 = new double[(n+1)*2];

  for ( i2 = 0; i2 < n + 1; i2++ )
  {
    if ( i2 < n )
    {
      i = order[i2];
    }
    else
    {
      i = order[0];
    }
    x2[2*i2]   = x[2*i];
    x2[2*i2+1] = x[2*i+1];
  }
//
//  Send the data to the plotter.
//
  tsp_display ( prefix, n + 1, x2 );

  delete [] x2;
//
//  Terminate.
//
  cout << "\n";
  cout << "tsp_nearest_test():\n";
  cout << "  Normal end of execution.\n";
  cout << "\n";
  timestamp ( );

  return 0;
}
//****************************************************************************80

void timestamp ( )

//****************************************************************************80
//
//  Purpose:
//
//    timestamp() prints the current YMDHMS date as a time stamp.
//
//  Example:
//
//    31 May 2001 09:45:54 AM
//
//  Licensing:
//
//    This code is distributed under the MIT license. 
//
//  Modified:
//
//    19 March 2018
//
//  Author:
//
//    John Burkardt
//
{
# define TIME_SIZE 40

  static char time_buffer[TIME_SIZE];
  const struct std::tm *tm_ptr;
  std::time_t now;

  now = std::time ( NULL );
  tm_ptr = std::localtime ( &now );

  std::strftime ( time_buffer, TIME_SIZE, "%d %B %Y %I:%M:%S %p", tm_ptr );

  std::cout << time_buffer << "\n";

  return;
# undef TIME_SIZE
}
//****************************************************************************80

void tsp_display ( string prefix, int n, double *x2 )

//****************************************************************************80
//
//  Purpose:
//
//    tsp_display() plots cities and a tour connecting them.
//
//  Discussion:
//
//    If a "round trip" is desired, then the x2 array must repeat the
//    first city at the end.
//
//  Licensing:
//
//    This code is distributed under the MIT license.
//
//  Modified:
//
//    13 June 2026
//
//  Author:
//
//    John Burkardt
//
//  Input:
//
//    string prefix: a string that defines the name of
//    the problem.  It is also used to create file names needed for
//    input to gnuplot.
//
//    int n: the number of cities.
//
//    double x[n*2]: the x and y coordinates of the cities.
//
{
  string command_filename;
  ofstream command;
  ofstream data;
  string data_filename;
  int i;
//
//  Create the data file.
//
  data_filename = prefix + "_data.txt";
  data.open ( data_filename.c_str ( ) );
  for ( i = 0; i < n; i++ )
  {
    data << x2[2*i] << "  " << x2[2*i+1] << "\n";
  }
  data.close ( );
  cout << "  Created data file '" << data_filename << "'\n";
//
//  Create the command file.
//
  command_filename = prefix + "_commands.txt";
  command.open ( command_filename.c_str ( ) );

  command << "# " << command_filename << "\n";
  command << "#\n";
  command << "# Usage:\n";
  command << "#  gnuplot < " << command_filename << "\n";
  command << "#\n";
  command << "set term png\n";
  command << "set output '" << prefix << ".png'\n";
  command << "set xlabel '<--- X --->'\n";
  command << "set ylabel '<--- Y --->'\n";
  command << "set title '" << prefix << "'\n";
  command << "set grid\n";
  command << "unset key\n";
  command << "set style data lines\n";
  command << "plot '" << data_filename 
          << "' using 1:2 lw 3 linecolor rgb 'blue', \\\n";
  command << "     '" << data_filename 
          << "' using 1:2 with points pointtype 7 pointsize 3 linecolor rgb 'green'\n";
  command << "quit\n";
  command.close ( );
  cout << "  Created command file '" << command_filename << "'\n";

  return;
}