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

//
//  This is the include statement I need for Mac OS X.
//
# include <GLUT/glut.h>

//# include <GL/glut.h>
//# include <GL/freeglut.h>

using namespace std;

int main ( int argc, char *argv[] );
bool ch_eqi ( char ch1, char ch2 );
int ch_to_digit ( char ch );
void display ( );
void grf_data_print ( int node_num, int edge_num, int edge_pointer[],
  int edge_data[], double xy[] );
void grf_data_read ( string input_filename, int node_num, int edge_num,
  int edge_pointer[], int edge_data[], double xy[] );
void grf_header_print ( int node_num, int edge_num );
void grf_header_read ( string input_filename, int *node_num, int *edge_num );
int i4vec_max ( int n, int a[] );
int i4vec_min ( int n, int a[] );
void myinit ( );
double r8_max ( double x, double y );
double *r82vec_max ( int n, double a[] );
double *r82vec_min ( int n, double a[] );
int s_len_trim ( string s );
int s_to_i4 ( string s, int *last, bool *error );
bool s_to_i4vec ( string s, int n, int ivec[] );
double s_to_r8 ( string s, int *lchar, bool *error );
bool s_to_r8vec ( string s, int n, double rvec[] );
int s_word_count ( string s );
void timestamp ( );
void xyl_data_print ( int point_num, int line_num,
  int line_data_num, int line_pointer[], int line_data[] );
void xyl_header_print ( int point_num, int line_num, int line_data_num );
//
//  Global data.
//
  int *line_data = NULL;
  int line_data_num;
  int line_num;
  int *line_pointer = NULL;
  int pixel_height;
  int pixel_width;
  int point_num = 0;
  double *xy = NULL;
  double *xy_max = NULL;
  double *xy_min = NULL;
  double xy_range[2];

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

int main ( int argc, char *argv[] )

//****************************************************************************80
//
//  Purpose:
//
//    MAIN is the main program for GRF_DISPLAY_OPENGL.
//
//  Discussion:
//
//    This program reads a GRF file describing an abstract graph
//    and displays an OpenGL image.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    13 January 2009
//
//  Author:
//
//    John Burkardt
//
//  Reference:
//
//    Edward Angel,
//    Interactive Computer Graphics:
//    A Top-Down Approach with OpenGL,
//    Second Edition,
//    Addison Wesley, 2000.
//
{
  int edge;
  int *edge_data;
  int edge_num;
  int *edge_pointer;
  int i;
  int node_i;
  int node_j;
  int node_num;
  string prefix;
  string grf_filename;

  cout << "\n";
  timestamp ( );

  cout << "\n";
  cout << "GRF_DISPLAY_OPENGL:\n";
  cout << "  C++ version\n";
  cout << "\n";
  cout << "  Compiled on " << __DATE__ << " at " << __TIME__ << ".\n";
  cout << "\n";
  cout << "  This is a program which uses OpenGL\n";
  cout << "  to display a graph stored in the GRF format.\n";
//
//  If the user did  not supply the prefix, request it.
//
  if ( argc <= 1 )
  {
    cout << "\n";
    cout << "GRFL_DISPLAY_OPENGL:\n";
    cout << "  Please enter the \"prefix\" of the GRF file.\n";

    cin >> prefix;
  }
  else
  {
    prefix = argv[1];
  }
//
//  Read the GRF data.
//
  grf_filename = prefix + ".grf";

  grf_header_read ( grf_filename, &node_num, &edge_num );

  grf_header_print ( node_num, edge_num );

  edge_pointer = new int[node_num+1];
  edge_data = new int[edge_num];
  xy = new double[2*node_num];

  grf_data_read ( grf_filename, node_num, edge_num, edge_pointer, edge_data, xy );

  if ( false )
  {
    grf_data_print ( node_num, edge_num, edge_pointer, edge_data, xy );
  }
//
//  Convert the GRF data to XY, XYL data.
//
  point_num = node_num;
  line_num = edge_num;
  line_data_num = 2 * edge_num;

  xyl_header_print ( point_num, line_num, line_data_num );

  line_pointer = new int[line_num+1];
  line_data = new int[line_data_num];

  line_num = 0;
  line_data_num = 0;
  line_pointer[0] = 0;

  for ( node_i = 0; node_i < node_num; node_i++ )
  {
    cout << "node_i = " << node_i << "\n";
    for ( edge = edge_pointer[node_i]; edge <= edge_pointer[node_i+1] - 1; edge++ )
    {
      node_j = edge_data[edge] - 1;

      line_data[line_data_num] = node_i;
      line_data_num = line_data_num + 1;
      line_data[line_data_num] = node_j;
      cout << node_i << "  " << node_j << "\n";
      line_data_num = line_data_num + 1;

      line_pointer[line_num+1] = line_data_num;
      line_num = line_num + 1;
    }
  }

  if ( false )
  {
    xyl_data_print ( point_num, line_num, line_data_num, line_pointer,
      line_data );
  }
//
//  Get the scale.
//
  xy_min = r82vec_min ( point_num, xy );
  xy_max = r82vec_max ( point_num, xy );

  xy_range[0] = xy_max[0] - xy_min[0];
  xy_range[1] = xy_max[1] - xy_min[1];

  cout << "\n";
  cout << "  Minimum: " << xy_min[0] << "  "
                        << xy_min[1] << "\n";
  cout << "  Maximum: " << xy_max[0] << "  "
                        << xy_max[1] << "\n";
  cout << "  Range:   " << xy_range[0] << "  "
                        << xy_range[1] << "\n";

  if ( xy_range[0] == 0.0 )
  {
    cout << "\n";
    cout << "XYL_DISPLAY_OPENGL - Fatal error!\n";
    cout << "  The X data range is 0.\n";
    exit ( 1 );
  }

  if ( xy_range[1] == 0.0 )
  {
    cout << "\n";
    cout << "XYL_DISPLAY_OPENGL - Fatal error!\n";
    cout << "  The Y data range is 0.\n";
    exit ( 1 );
  }
//
//  Begin graphics.
//

  glutInit ( &argc, argv );

  glutInitDisplayMode ( GLUT_SINGLE | GLUT_RGB );

  if ( xy_range[1] < xy_range[0] )
  {
    pixel_width = 500;
    pixel_height = ( int )
      ( ( double ) ( 500 ) * xy_range[1] / xy_range[0] );
  }
  else
  {
    pixel_width = ( int )
      ( ( double ) ( 500 ) * xy_range[0] / xy_range[1] );
    pixel_height = 500;
  }
  cout << "  Pixels:  " << pixel_width  << "  "
                        << pixel_height << "\n";

  glutInitWindowSize ( pixel_width, pixel_height );
  glutInitWindowPosition ( 0, 0 );
  glutCreateWindow ( prefix.c_str() );
  glutDisplayFunc ( display );

  myinit ( );

  glutMainLoop ( );
//
//  Free memory.
//
  delete [] edge_data;
  delete [] edge_pointer;
  delete [] line_data;
  delete [] line_pointer;
  delete [] xy;
//
//  Terminate.
//
  cout << "\n";
  cout << "GRF_DISPLAY_OPENGL:\n";
  cout << "  Normal end of execution.\n";

  cout << "\n";
  timestamp ( );

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

bool ch_eqi ( char ch1, char ch2 )

//****************************************************************************80
//
//  Purpose:
//
//    CH_EQI is true if two characters are equal, disregarding case.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    13 June 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, char CH1, CH2, the characters to compare.
//
//    Output, bool CH_EQI, is true if the two characters are equal,
//    disregarding case.
//
{
  if ( 97 <= ch1 && ch1 <= 122 )
  {
    ch1 = ch1 - 32;
  }
  if ( 97 <= ch2 && ch2 <= 122 )
  {
    ch2 = ch2 - 32;
  }

  return ( ch1 == ch2 );
}
//****************************************************************************80

int ch_to_digit ( char ch )

//****************************************************************************80
//
//  Purpose:
//
//    CH_TO_DIGIT returns the integer value of a base 10 digit.
//
//  Example:
//
//     CH  DIGIT
//    ---  -----
//    '0'    0
//    '1'    1
//    ...  ...
//    '9'    9
//    ' '    0
//    'X'   -1
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    13 June 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, char CH, the decimal digit, '0' through '9' or blank are legal.
//
//    Output, int CH_TO_DIGIT, the corresponding integer value.  If the character was
//    'illegal', then DIGIT is -1.
//
{
  int digit;

  if ( '0' <= ch && ch <= '9' )
  {
    digit = ch - '0';
  }
  else if ( ch == ' ' )
  {
    digit = 0;
  }
  else
  {
    digit = -1;
  }

  return digit;
}
//****************************************************************************80

void display ( )

//****************************************************************************80
//
//  Purpose:
//
//    DISPLAY generates the graphics output.
//
//  Discussion;
//
//    We plot the points whose coordinates are in XY.
//
//    We also dump an ASCII PPM file of the screen.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    22 June 2006
//
//  Author:
//
//    John Burkardt
//
//  Reference:
//
//    Edward Angel,
//    Interactive Computer Graphics:
//    A Top-Down Approach with OpenGL,
//    Second Edition,
//    Addison Wesley, 2000.
//
{
  int i;
  int j;
  int line;
  float p[2];
  int point;
//
//  Clear the window.
//
  glClear ( GL_COLOR_BUFFER_BIT );
//
//  Draw points in BLUE.
//
  glColor3f ( 0.0, 0.0, 1.0 );

  for ( point = 0; point < point_num; point++ )
  {
    glBegin ( GL_POINTS );

      p[0] = ( float ) xy[0+point*2];
      p[1] = ( float ) xy[1+point*2];

      glVertex2fv ( p );

    glEnd ( );
  }
//
//  Draw lines in RED.
//
  glColor3f ( 1.0, 0.0, 0.0 );

  for ( line = 0; line < line_num; line++ )
  {
    glBegin ( GL_LINE_STRIP );

    for ( j = line_pointer[line]; j < line_pointer[line+1]; j++ )
    {
      point = line_data[j];
      p[0] = ( float ) xy[0+point*2];
      p[1] = ( float ) xy[1+point*2];

      glVertex2fv ( p );
    }
    glEnd ( );
  }
//
//  Clear all the buffers.
//
  glFlush ( );

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

void grf_data_print ( int node_num, int edge_num, int edge_pointer[],
  int edge_data[], double xy[] )

//****************************************************************************80
//
//  Purpose:
//
//    GRF_DATA_PRINT prints the data of a GRF file.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    11 January 2009
//
//  Author:
//
//    John Burkardt
//
//  Reference:
//
//    Stephen Skiena,
//    Implementing Discrete Mathematics,
//    Combinatorics and Graph Theory with Mathematica,
//    Addison-Wesley, 1990.
//
//  Parameters:
//
//    Input, int NODE_NUM, the number of nodes.
//
//    Input, int EDGE_NUM, the number of edges.
//
//    Input, int EDGE_POINTER[NODE_NUM+1], pointers to
//    the beginning of edge data for each node.
//
//    Input, int EDGE_DATA[EDGE_NUM], the edge data.
//
//    Input, double XY[2*NODE_NUM], the node coordinates.
//
{
  int edge;
  int node;

  cout << "\n";
  cout << "  Edge pointers:\n";
  cout << "\n";
  cout << "  Node     First      Last\n";
  cout << "\n";
  for ( node = 0; node < node_num; node++ )
  {
    cout << "  " << setw(4) << node
         << "  " << setw(8) << edge_pointer[node]
         << "  " << setw(8) << edge_pointer[node+1] - 1 << "\n";
  }

  cout << "\n";
  cout << "  Edge data:\n";
  cout << "\n";
  cout << "  Node     Adjacent nodes\n";
  cout << "\n";

  for ( node = 0; node < node_num; node++ )
  {
    cout << "  " << setw(4) << node;
    for ( edge = edge_pointer[node]; edge <= edge_pointer[node+1] - 1; edge++ )
    {
      cout << "  " << setw(8) <<  edge_data[edge];
    }
    cout << "\n";
  }

  cout << "\n";
  cout << "  Node        X          Y\n";
  cout << "\n";

  for ( node = 0; node < node_num; node++ )
  {
    cout << "  " << setw(4) << node
         << "  " << setw(10) << xy[0+node*2]
         << "  " << setw(10) << xy[1+node*2] << "\n";
  }

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

void grf_data_read ( string input_filename, int node_num, int edge_num,
  int edge_pointer[], int edge_data[], double xy[] )

//****************************************************************************80
//
//  Purpose:
//
//    GRF_DATA_READ reads the data of a GRF file.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    13 January 2009
//
//  Author:
//
//    John Burkardt
//
//  Reference:
//
//    Stephen Skiena,
//    Implementing Discrete Mathematics,
//    Combinatorics and Graph Theory with Mathematica,
//    Addison-Wesley, 1990.
//
//  Parameters:
//
//    Input, string INPUT_FILENAME, the name of the file.
//
//    Input, int NODE_NUM, the number of nodes.
//
//    Input, int EDGE_NUM, the number of edges.
//
//    Output, int EDGE_POINTER[NODE_NUM+1], pointers to
//    the beginning of edge data for each node.
//
//    Output, int EDGE_DATA[EDGE_NUM], the edge data.
//
//    Output, double XY[2*NODE_NUM], the node coordinates.
//
{
  int edge;
  int i;
  ifstream input;
  int n;
  int node;
  int node_i;
  int node_j;
//char text[255];
  string text;
  int text_begin;
  int text_end;
  double xval;
  double yval;

  for ( edge = 0; edge < edge_num; edge++ )
  {
    edge_data[edge] = -1;
  }

  for ( node = 0; node < node_num + 1; node++ )
  {
    edge_pointer[node] = -1;
  }

  input.open ( input_filename.c_str() );

  if ( !input )
  {
    cout << "\n";
    cout << "GRF_DATA_READ - Fatal error!\n";
    cout << "  Cannot open the input file \"" << input_filename << "\".\n";
    exit ( 1 );
  }
//
//  Read a line.  If it's a blank or comment, skip it.
//  Otherwise, count the number of "words", and then reread it.
//
  edge = 0;
  node = 0;
  edge_pointer[0] = 0;

  for ( node = 0; node < node_num; node++ )
  {
    text_begin = input.tellg ( );

//  input.getline ( text, sizeof ( text ) );
    getline ( input, text );

    if ( input.eof ( ) )
    {
      cout << "\n";
      cout << "GRF_DATA_READ - Fatal error!\n";
      cout << "  Unexpected end of information;\n";
      exit ( 1 );
    }

    if ( s_len_trim ( text ) <= 0 )
    {
      continue;
    }

    if ( text[0] == '#' )
    {
      continue;
    }

    n = s_word_count ( text );

    if ( n < 3 )
    {
      cout << "\n";
      cout << "GRF_DATA_READ - Fatal error!\n";
      cout << "  Record has less than 3 items.\n";
      exit ( 1 );
    }
    text_end = input.tellg ( );
//
//  Back up and reread the line.
//
    input.seekg ( text_begin );

    input >> node_i >> xval >> yval;

    edge_pointer[node+1] = edge_pointer[node] + n - 3;

    xy[0+node*2] = xval;
    xy[1+node*2] = yval;

    for ( i = 0; i < n - 3; i++ )
    {
      input >> node_j;
      edge_data[edge] = node_j;
      edge = edge + 1;
    }

    input.seekg ( text_end );
  }

  input.close ( );

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

void grf_header_print ( int node_num, int edge_num )

//****************************************************************************80
//
//  Purpose:
//
//    GRF_HEADER_PRINT prints the header of a GRF file.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    10 January 2009
//
//  Author:
//
//    John Burkardt
//
//  Reference:
//
//    Stephen Skiena,
//    Implementing Discrete Mathematics,
//    Combinatorics and Graph Theory with Mathematica,
//    Addison-Wesley, 1990.
//
//  Parameters:
//
//    Input, int NODE_NUM, the number of nodes.
//
//    Input, int EDGE_NUM, the number of edges.
//
{
  cout << "\n";
  cout << "  The number of nodes NODE_NUM = " << node_num << "\n";
  cout << "  The number of edges EDGE_NUM = " << edge_num << "\n";

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

void grf_header_read ( string input_filename, int *node_num, int *edge_num )

//****************************************************************************80
//
//  Purpose:
//
//    GRF_HEADER_READ reads the header of a GRF file.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    25 October 2010
//
//  Author:
//
//    John Burkardt
//
//  Reference:
//
//    Stephen Skiena,
//    Implementing Discrete Mathematics,
//    Combinatorics and Graph Theory with Mathematica,
//    Addison-Wesley, 1990.
//
//  Parameters:
//
//    Input, string INPUT_FILENAME, the name of the file.
//
//    Output, int *NODE_NUM, the number of nodes.
//
//    Output, int *EDGE_NUM, the number of edges.
//
{
  ifstream input;
  int n;
  string text;

  *edge_num = 0;
  *node_num = 0;

  input.open ( input_filename.c_str() );

  if ( !input )
  {
    cout << "\n";
    cout << "GRF_HEADER_READ - Fatal error!\n";
    cout << "  Cannot open the input file \"" << input_filename << "\".\n";
    exit ( 1 );
  }

  for ( ; ; )
  {
    getline ( input, text );

    if ( input.eof ( ) )
    {
      break;
    }

    if ( text[0] == '#' || s_len_trim ( text ) == 0 )
    {
      continue;
    }

    n = s_word_count ( text );

    if ( n < 3 )
    {
      cout << "\n";
      cout << "GRF_HEADER_READ - Fatal error!\n";
      cout << "  Illegal record has less than 3 data items\n";
      exit ( 1 );
    }
    *edge_num = *edge_num + n - 3;
    *node_num = *node_num + 1;
  }

  input.close ( );

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

int i4vec_max ( int n, int a[] )

//****************************************************************************80
//
//  Purpose:
//
//    I4VEC_MAX returns the value of the maximum element in an I4VEC.
//
//  Discussion:
//
//    An I4VEC is a vector of I4's.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    17 May 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int N, the number of entries in the array.
//
//    Input, int A[N], the array to be checked.
//
//    Output, int I4VEC_MAX, the value of the maximum element.  This
//    is set to 0 if N <= 0.
//
{
  int i;
  int value;

  if ( n <= 0 )
  {
    return 0;
  }

  value = a[0];

  for ( i = 1; i < n; i++ )
  {
    if ( value < a[i] )
    {
      value = a[i];
    }
  }

  return value;
}
//****************************************************************************80

int i4vec_min ( int n, int a[] )

//****************************************************************************80
//
//  Purpose:
//
//    I4VEC_MIN returns the value of the minimum element in an I4VEC.
//
//  Discussion:
//
//    An I4VEC is a vector of I4's.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    17 May 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int N, the number of entries in the array.
//
//    Input, int A[N], the array to be checked.
//
//    Output, int I4VEC_MIN, the value of the minimum element.  This
//    is set to 0 if N <= 0.
//
{
  int i;
  int value;

  if ( n <= 0 )
  {
    return 0;
  }

  value = a[0];

  for ( i = 1; i < n; i++ )
  {
    if ( a[i] < value )
    {
      value = a[i];
    }
  }
  return value;
}
//****************************************************************************80

void myinit ( )

//****************************************************************************80
//
//  Purpose:
//
//    MYINIT initializes OpenGL state variables dealing with viewing and attributes.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    23 June 2006
//
//  Author:
//
//    John Burkardt
//
//  Reference:
//
//    Edward Angel,
//    Interactive Computer Graphics:
//    A Top-Down Approach with OpenGL,
//    Second Edition,
//    Addison Wesley, 2000.
{
  double margin;
  float x_max;
  float x_min;
  float y_max;
  float y_min;
//
//  Set the background to WHITE.
//
  glClearColor ( 1.0, 1.0, 1.0, 1.0 );
//
//  The default point size is 1.0.
//
  if ( point_num <= 100 )
  {
    glPointSize ( 5.0 );
  }
  else if ( point_num <= 500 )
  {
    glPointSize ( 3.0 );
  }
  else
  {
    glPointSize ( 1.0 );
  }
//
//  Set up the viewing window with origin at the lower left.
//
  glMatrixMode ( GL_PROJECTION );
  glLoadIdentity ( );
//
//  Determine an amount MARGIN by which it would be appropriate to spread the
//  data range, so that all the data is comfortably inside the picture.
//
  margin = 0.025 * r8_max (
    xy_max[0] - xy_min[0],
    xy_max[1] - xy_min[1] );

  x_min = ( float ) ( xy_min[0] - margin );
  x_max = ( float ) ( xy_max[0] + margin );
  y_min = ( float ) ( xy_min[1] - margin );
  y_max = ( float ) ( xy_max[1] + margin );
//
//  Specify an orthogonal view.
//
  gluOrtho2D ( x_min, x_max, y_min, y_max );

  glMatrixMode ( GL_MODELVIEW );

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

double r8_max ( double x, double y )

//****************************************************************************80
//
//  Purpose:
//
//    R8_MAX returns the maximum of two R8.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    18 August 2004
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, double X, Y, the quantities to compare.
//
//    Output, double R8_MAX, the maximum of X and Y.
//
{
  if ( y < x )
  {
    return x;
  }
  else
  {
    return y;
  }
}
//****************************************************************************80

double *r82vec_max ( int n, double a[] )

//****************************************************************************80
//
//  Purpose:
//
//    R82VEC_MAX returns the maximum value in a R82VEC.
//
//  Discussion:
//
//    An R82VEC is an array of pairs of double precision real values.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    21 June 2006
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int N, the number of entries in the array.
//
//    Input, double A[2*N], the array.
//
//    Output, double R82VEC_MAX[2]; the largest entries in each row.
//
{
  double *amax = NULL;
  int i;

  if ( n <= 0 )
  {
    return NULL;
  }

  amax = new double[2];

  amax[0] = a[0+0*2];
  amax[1] = a[1+0*2];

  for ( i = 1; i < n; i++ )
  {
    if ( amax[0] < a[0+i*2] )
    {
      amax[0] = a[0+i*2];
    }
    if ( amax[1] < a[1+i*2] )
    {
      amax[1] = a[1+i*2];
    }
  }
  return amax;
}
//****************************************************************************80

double *r82vec_min ( int n, double a[] )

//****************************************************************************80
//
//  Purpose:
//
//    R82VEC_MIN returns the minimum value in a R82VEC.
//
//  Discussion:
//
//    A R82VEC is an array of pairs of R8's.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    21 June 2006
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int N, the number of entries in the array.
//
//    Input, double A[2*N], the array.
//
//    Output, double R82VEC_MIN[2]; the smallest entries in each row.
//
{
  double *amin = NULL;
  int i;

  if ( n <= 0 )
  {
    return NULL;
  }

  amin = new double[2];

  amin[0] = a[0+0*2];
  amin[1] = a[1+0*2];

  for ( i = 1; i < n; i++ )
  {
    if ( a[0+i*2] < amin[0] )
    {
      amin[0] = a[0+i*2];
    }
    if ( a[1+i*2] < amin[1] )
    {
      amin[1] = a[1+i*2];
    }
  }
  return amin;
}
//****************************************************************************80

int s_len_trim ( string s )

//****************************************************************************80
//
//  Purpose:
//
//    S_LEN_TRIM returns the length of a string to the last nonblank.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    05 July 2009
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, string S, a string.
//
//    Output, int S_LEN_TRIM, the length of the string to the last nonblank.
//    If S_LEN_TRIM is 0, then the string is entirely blank.
//
{
  int n;

  n = s.length ( );

  while ( 0 < n )
  {
    if ( s[n-1] != ' ' )
    {
      return n;
    }
    n = n - 1;
  }

  return n;
}
//****************************************************************************80

int s_to_i4 ( string s, int *last, bool *error )

//****************************************************************************80
//
//  Purpose:
//
//    S_TO_I4 reads an I4 from a string.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    05 July 2009
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, string S, a string to be examined.
//
//    Output, int *LAST, the last character of S used to make IVAL.
//
//    Output, bool *ERROR is TRUE if an error occurred.
//
//    Output, int *S_TO_I4, the integer value read from the string.
//    If the string is blank, then IVAL will be returned 0.
//
{
  char c;
  int i;
  int isgn;
  int istate;
  int ival;

  *error = false;
  istate = 0;
  isgn = 1;
  i = 0;
  ival = 0;

  for ( ; ; )
  {
    c = s[i];
    i = i + 1;
//
//  Haven't read anything.
//
    if ( istate == 0 )
    {
      if ( c == ' ' )
      {
      }
      else if ( c == '-' )
      {
        istate = 1;
        isgn = -1;
      }
      else if ( c == '+' )
      {
        istate = 1;
        isgn = + 1;
      }
      else if ( '0' <= c && c <= '9' )
      {
        istate = 2;
        ival = c - '0';
      }
      else
      {
        *error = true;
        return ival;
      }
    }
//
//  Have read the sign, expecting digits.
//
    else if ( istate == 1 )
    {
      if ( c == ' ' )
      {
      }
      else if ( '0' <= c && c <= '9' )
      {
        istate = 2;
        ival = c - '0';
      }
      else
      {
        *error = true;
        return ival;
      }
    }
//
//  Have read at least one digit, expecting more.
//
    else if ( istate == 2 )
    {
      if ( '0' <= c && c <= '9' )
      {
        ival = 10 * (ival) + c - '0';
      }
      else
      {
        ival = isgn * ival;
        *last = i - 1;
        return ival;
      }

    }
  }
//
//  If we read all the characters in the string, see if we're OK.
//
  if ( istate == 2 )
  {
    ival = isgn * ival;
    *last = s_len_trim ( s );
  }
  else
  {
    *error = true;
    *last = 0;
  }

  return ival;
}
//****************************************************************************80

bool s_to_i4vec ( string s, int n, int ivec[] )

//****************************************************************************80
//
//  Purpose:
//
//    S_TO_I4VEC reads an I4VEC from a string.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    05 July 2009
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, string S, the string to be read.
//
//    Input, int N, the number of values expected.
//
//    Output, int IVEC[N], the values read from the string.
//
//    Output, bool S_TO_I4VEC, is TRUE if an error occurred.
//
{
  int begin;
  bool error;
  int i;
  int lchar;
  int length;

  begin = 0;
  length = s.length ( );
  error = 0;

  for ( i = 0; i < n; i++ )
  {
    ivec[i] = s_to_i4 ( s.substr(begin,length), &lchar, &error );

    if ( error )
    {
      return error;
    }
    begin = begin + lchar;
    length = length - lchar;
  }

  return error;
}
//****************************************************************************80

double s_to_r8 ( string s, int *lchar, bool *error )

//****************************************************************************80
//
//  Purpose:
//
//    S_TO_R8 reads an R8 from a string.
//
//  Discussion:
//
//    This routine will read as many characters as possible until it reaches
//    the end of the string, or encounters a character which cannot be
//    part of the real number.
//
//    Legal input is:
//
//       1 blanks,
//       2 '+' or '-' sign,
//       2.5 spaces
//       3 integer part,
//       4 decimal point,
//       5 fraction part,
//       6 'E' or 'e' or 'D' or 'd', exponent marker,
//       7 exponent sign,
//       8 exponent integer part,
//       9 exponent decimal point,
//      10 exponent fraction part,
//      11 blanks,
//      12 final comma or semicolon.
//
//    with most quantities optional.
//
//  Example:
//
//    S                 R
//
//    '1'               1.0
//    '     1   '       1.0
//    '1A'              1.0
//    '12,34,56'        12.0
//    '  34 7'          34.0
//    '-1E2ABCD'        -100.0
//    '-1X2ABCD'        -1.0
//    ' 2E-1'           0.2
//    '23.45'           23.45
//    '-4.2E+2'         -420.0
//    '17d2'            1700.0
//    '-14e-2'         -0.14
//    'e2'              100.0
//    '-12.73e-9.23'   -12.73 * 10.0**(-9.23)
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    05 July 2009
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, string S, the string containing the
//    data to be read.  Reading will begin at position 1 and
//    terminate at the end of the string, or when no more
//    characters can be read to form a legal real.  Blanks,
//    commas, or other nonnumeric data will, in particular,
//    cause the conversion to halt.
//
//    Output, int *LCHAR, the number of characters read from
//    the string to form the number, including any terminating
//    characters such as a trailing comma or blanks.
//
//    Output, bool *ERROR, is true if an error occurred.
//
//    Output, double S_TO_R8, the real value that was read from the string.
//
{
  char c;
  int ihave;
  int isgn;
  int iterm;
  int jbot;
  int jsgn;
  int jtop;
  int nchar;
  int ndig;
  double r;
  double rbot;
  double rexp;
  double rtop;
  char TAB = 9;

  nchar = s_len_trim ( s );
  *error = false;
  r = 0.0;
  *lchar = -1;
  isgn = 1;
  rtop = 0.0;
  rbot = 1.0;
  jsgn = 1;
  jtop = 0;
  jbot = 1;
  ihave = 1;
  iterm = 0;

  for ( ; ; )
  {
    c = s[*lchar+1];
    *lchar = *lchar + 1;
//
//  Blank or TAB character.
//
    if ( c == ' ' || c == TAB )
    {
      if ( ihave == 2 )
      {
      }
      else if ( ihave == 6 || ihave == 7 )
      {
        iterm = 1;
      }
      else if ( 1 < ihave )
      {
        ihave = 11;
      }
    }
//
//  Comma.
//
    else if ( c == ',' || c == ';' )
    {
      if ( ihave != 1 )
      {
        iterm = 1;
        ihave = 12;
        *lchar = *lchar + 1;
      }
    }
//
//  Minus sign.
//
    else if ( c == '-' )
    {
      if ( ihave == 1 )
      {
        ihave = 2;
        isgn = -1;
      }
      else if ( ihave == 6 )
      {
        ihave = 7;
        jsgn = -1;
      }
      else
      {
        iterm = 1;
      }
    }
//
//  Plus sign.
//
    else if ( c == '+' )
    {
      if ( ihave == 1 )
      {
        ihave = 2;
      }
      else if ( ihave == 6 )
      {
        ihave = 7;
      }
      else
      {
        iterm = 1;
      }
    }
//
//  Decimal point.
//
    else if ( c == '.' )
    {
      if ( ihave < 4 )
      {
        ihave = 4;
      }
      else if ( 6 <= ihave && ihave <= 8 )
      {
        ihave = 9;
      }
      else
      {
        iterm = 1;
      }
    }
//
//  Exponent marker.
//
    else if ( ch_eqi ( c, 'E' ) || ch_eqi ( c, 'D' ) )
    {
      if ( ihave < 6 )
      {
        ihave = 6;
      }
      else
      {
        iterm = 1;
      }
    }
//
//  Digit.
//
    else if ( ihave < 11 && '0' <= c && c <= '9' )
    {
      if ( ihave <= 2 )
      {
        ihave = 3;
      }
      else if ( ihave == 4 )
      {
        ihave = 5;
      }
      else if ( ihave == 6 || ihave == 7 )
      {
        ihave = 8;
      }
      else if ( ihave == 9 )
      {
        ihave = 10;
      }

      ndig = ch_to_digit ( c );

      if ( ihave == 3 )
      {
        rtop = 10.0 * rtop + ( double ) ndig;
      }
      else if ( ihave == 5 )
      {
        rtop = 10.0 * rtop + ( double ) ndig;
        rbot = 10.0 * rbot;
      }
      else if ( ihave == 8 )
      {
        jtop = 10 * jtop + ndig;
      }
      else if ( ihave == 10 )
      {
        jtop = 10 * jtop + ndig;
        jbot = 10 * jbot;
      }

    }
//
//  Anything else is regarded as a terminator.
//
    else
    {
      iterm = 1;
    }
//
//  If we haven't seen a terminator, and we haven't examined the
//  entire string, go get the next character.
//
    if ( iterm == 1 || nchar <= *lchar + 1 )
    {
      break;
    }

  }
//
//  If we haven't seen a terminator, and we have examined the
//  entire string, then we're done, and LCHAR is equal to NCHAR.
//
  if ( iterm != 1 && (*lchar) + 1 == nchar )
  {
    *lchar = nchar;
  }
//
//  Number seems to have terminated.  Have we got a legal number?
//  Not if we terminated in states 1, 2, 6 or 7!
//
  if ( ihave == 1 || ihave == 2 || ihave == 6 || ihave == 7 )
  {
    *error = true;
    return r;
  }
//
//  Number seems OK.  Form it.
//
  if ( jtop == 0 )
  {
    rexp = 1.0;
  }
  else
  {
    if ( jbot == 1 )
    {
      rexp = pow ( 10.0, jsgn * jtop );
    }
    else
    {
      rexp = jsgn * jtop;
      rexp = rexp / jbot;
      rexp = pow ( 10.0, rexp );
    }

  }

  r = isgn * rexp * rtop / rbot;

  return r;
}
//****************************************************************************80

bool s_to_r8vec ( string s, int n, double rvec[] )

//****************************************************************************80
//
//  Purpose:
//
//    S_TO_R8VEC reads an R8VEC from a string.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    05 July 2009
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, string S, the string to be read.
//
//    Input, int N, the number of values expected.
//
//    Output, double RVEC[N], the values read from the string.
//
//    Output, bool S_TO_R8VEC, is true if an error occurred.
//
{
  int begin;
  bool error;
  int i;
  int lchar;
  int length;

  begin = 0;
  length = s.length ( );
  error = 0;

  for ( i = 0; i < n; i++ )
  {
    rvec[i] = s_to_r8 ( s.substr(begin,length), &lchar, &error );

    if ( error )
    {
      return error;
    }
    begin = begin + lchar;
    length = length - lchar;
  }

  return error;
}
//****************************************************************************80

int s_word_count ( string s )

//****************************************************************************80
//
//  Purpose:
//
//    S_WORD_COUNT counts the number of "words" in a string.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    05 July 2009
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, string S, the string to be examined.
//
//    Output, int S_WORD_COUNT, the number of "words" in the string.
//    Words are presumed to be separated by one or more blanks.
//
{
  bool blank;
  int char_count;
  int i;
  int word_count;

  word_count = 0;
  blank = true;

  char_count = s.length ( );

  for ( i = 0; i < char_count; i++ )
  {
    if ( isspace ( s[i] ) )
    {
      blank = true;
    }
    else if ( blank )
    {
      word_count = word_count + 1;
      blank = false;
    }
  }

  return word_count;
}
//****************************************************************************80

void timestamp ( )

//****************************************************************************80
//
//  Purpose:
//
//    TIMESTAMP prints the current YMDHMS date as a time stamp.
//
//  Example:
//
//    May 31 2001 09:45:54 AM
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    02 October 2003
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    None
//
{
# define TIME_SIZE 40

  static char time_buffer[TIME_SIZE];
  const struct tm *tm;
  size_t len;
  time_t now;

  now = time ( NULL );
  tm = localtime ( &now );

  len = strftime ( time_buffer, TIME_SIZE, "%d %B %Y %I:%M:%S %p", tm );

  cout << time_buffer << "\n";

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

void xyl_data_print ( int point_num, int line_num,
  int line_data_num, int line_pointer[], int line_data[] )

//****************************************************************************80
//
//  Purpose:
//
//    XYL_DATA_PRINT prints the data of an XYL file.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    08 January 2009
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int POINT_NUM, the number of points.
//
//    Input, int LINE_NUM, the number of lines.
//
//    Input, int LINE_DATA_NUM, the number of line items.
//
//    Input, int LINE_POINTER[LINE_NUM+1], pointers to the
//    first line item for each line.
//
//    Input, int LINE_DATA[LINE_DATA_NUM], indices
//    of points that form lines.
//
{
  int i;
  int line;

  for ( line = 0; line < line_num; line++ )
  {
    cout << "  " << setw(4) << line
         << "  " << setw(8) << line_pointer[line]
         << "  " << setw(8) << line_pointer[line+1] - 1 << "\n";
  }

  cout << "\n";

  for ( line = 0; line < line_num; line++ )
  {
    for ( i = line_pointer[line]; i < line_pointer[line+1]; i++ )
    {
      cout << "  " << line_data[i];
    }
    cout << "\n";
  }
  return;
}
//****************************************************************************80

void xyl_header_print ( int point_num, int line_num, int line_data_num )

//****************************************************************************80
//
//  Purpose:
//
//    XYL_HEADER_PRINT prints the header of an XYL file.
//
//  Licensing:
//
//    This code is distributed under the GNU LGPL license.
//
//  Modified:
//
//    03 January 2009
//
//  Author:
//
//    John Burkardt
//
//  Parameters:
//
//    Input, int POINT_NUM, the number of points.
//
//    Input, int LINE_NUM, the number of lines.
//
//    Input, int LINE_DATA_NUM, the number of line items.
//
{
  cout << "\n";
  cout << "  Number of points     = " << point_num << "\n";
  cout << "  Number of lines      = " << line_num << "\n";
  cout << "  Number of line items = " << line_data_num << "\n";

  return;
}