/* nag_mv_distance_mat (g03eac) Example Program.
 *
 * Copyright 1998 Numerical Algorithms Group.
 *
 * Mark 5, 1998.
 * Mark 8 revised, 2004.
 *
 */

#include <nag.h>
#include <nagx04.h>
#include <stdio.h>
#include <nag_stdlib.h>
#include <nagg03.h>

#define X(I, J) x[(I) *tdx + J]
int main(int argc, char *argv[])
{
  FILE             *fpin, *fpout;
  Integer          exit_status = 0, i, *isx = 0, j, m, n, tdx;
  double           *d = 0, *s = 0, *x = 0;
  char             nag_enum_arg[40];
  Nag_DistanceType dist;
  Nag_MatUpdate    update;
  Nag_VarScaleType scale;
  NagError         fail;

  INIT_FAIL(fail);

  /* Check for command-line IO options */
  fpin = nag_example_file_io(argc, argv, "-data", NULL);
  fpout = nag_example_file_io(argc, argv, "-results", NULL);

  fprintf(fpout, "nag_mv_distance_mat (g03eac) Example Program Results\n\n");

  /* Skip heading in data file */
  fscanf(fpin, "%*[^\n]");

  fscanf(fpin, "%ld", &n);
  fscanf(fpin, "%ld", &m);
  if (n >= 2 && m >= 1)
    {
      if (!(d = NAG_ALLOC(n*(n-1)/2, double)) ||
          !(s = NAG_ALLOC(m, double)) ||
          !(x = NAG_ALLOC((n)*(m), double)) ||
          !(isx = NAG_ALLOC(m, Integer)))
        {
          fprintf(fpout, "Allocation failure\n");
          exit_status = -1;
          goto END;
        }
      tdx = m;
    }
  else
    {
      fprintf(fpout, "Invalid n or m.\n");
      exit_status = 1;
      return exit_status;
    }
  fscanf(fpin, "%s", nag_enum_arg);
  /* nag_enum_name_to_value(x04nac).
   * Converts NAG enum member name to value
   */
  update = (Nag_MatUpdate) nag_enum_name_to_value(nag_enum_arg);
  fscanf(fpin, "%s", nag_enum_arg);
  dist = (Nag_DistanceType) nag_enum_name_to_value(nag_enum_arg);
  fscanf(fpin, "%s", nag_enum_arg);
  scale = (Nag_VarScaleType) nag_enum_name_to_value(nag_enum_arg);
  for (j = 0; j < n; ++j)
    {
      for (i = 0; i < m; ++i)
        fscanf(fpin, "%lf", &X(j, i));
    }
  for (i = 0; i < m; ++i)
    fscanf(fpin, "%ld", &isx[i]);
  for (i = 0; i < m; ++i)
    fscanf(fpin, "%lf", &s[i]);

  /* nag_mv_distance_mat (g03eac).
   * Compute distance (dissimilarity) matrix
   */
  nag_mv_distance_mat(update, dist, scale, n, m, x, tdx, isx, s, d, &fail);
  if (fail.code != NE_NOERROR)
    {
      fprintf(fpout, "Error from nag_mv_distance_mat (g03eac).\n%s\n",
              fail.message);
      exit_status = 1;
      goto END;
    }

  /* Print the distance matrix */

  fprintf(fpout, "\n");
  fprintf(fpout, " Distance Matrix ");
  fprintf(fpout, "\n");
  fprintf(fpout, "\n");
  fprintf(fpout, "    %s\n", "   1       2       3       4");
  fprintf(fpout, "\n");
  for (i = 2; i <= n; ++i)
    {
      fprintf(fpout, "%2ld     ", i);
      for (j = (i-1)*(i-2)/2+1; j <= i*(i - 1)/2; ++j)
        fprintf(fpout, "%5.2f   ", d[j-1]);
      fprintf(fpout, "\n");
    }

 END:
  if (fpin != stdin) fclose(fpin);
  if (fpout != stdout) fclose(fpout);
  if (d) NAG_FREE(d);
  if (s) NAG_FREE(s);
  if (x) NAG_FREE(x);
  if (isx) NAG_FREE(isx);

  return exit_status;
}