/* nag_mv_dendrogram (g03ehc) Example Program.
 *
 * Copyright 1998 Numerical Algorithms Group.
 *
 * Mark 5, 1998.
 *
 */

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


#define NMAX 10
#define MMAX 10
#define LDC 100

int main(void)
{

  double cd[NMAX-1], d[NMAX*(NMAX-1)/2], dord[NMAX],
  s[MMAX], x[NMAX][MMAX];
  double dmin_;
  double dstep;

  Integer ilc[NMAX-1], iord[NMAX], isx[MMAX], iuc[NMAX-1];
  Integer nsym;
  Integer i, j;
  Integer m, n;
  Integer int_method;
  Integer tdx;

  char char_dist[2];
  char char_scale[2];
  char char_update[2];
  char **c=0;

  Nag_ClusterMethod method;
  Nag_MatUpdate update;
  Nag_DistanceType dist;
  Nag_VarScaleType scale;

  tdx = MMAX;
  Vprintf("g03ehc Example Program Results\n\n");

  Vscanf("%*[^\n]");
  Vscanf("%ld",&n);
  Vscanf("%ld",&m);

  if (n <= NMAX && m <= MMAX)
    {
      Vscanf("%ld",&int_method);
      if (int_method == 1)
        method = Nag_SingleLink;
      else  if (int_method == 2)
        method = Nag_CompleteLink;
      else  if (int_method == 3)
        method = Nag_GroupAverage;
      else if (int_method == 4)
        method = Nag_Centroid;
      else  if (int_method == 5)
        method = Nag_Median;
      else
        method = Nag_MinVariance;


      Vscanf("%s",char_update);
      if (*char_update == 'U')
        update = Nag_MatUp;
      else
        update = Nag_NoMatUp;

      Vscanf("%s",char_dist);
      if (*char_dist == 'A')
        dist = Nag_DistAbs;
      else if (*char_dist == 'E')
        dist = Nag_DistEuclid;
      else
        dist = Nag_DistSquared;

      Vscanf("%s",char_scale);
      if (*char_scale == 'S')
        scale = Nag_VarScaleStd;
      else if (*char_scale == 'R')
        scale = Nag_VarScaleRange;
      else if (*char_scale == 'G')
        scale = Nag_VarScaleUser;
      else
        scale = Nag_NoVarScale;

      for (j = 0; j < n; ++j)
        {
          for (i = 0; i < m; ++i)
            Vscanf("%lf",&x[j][i]);
        }
      for (i = 0; i < m; ++i)
        Vscanf("%ld",&isx[i]);
      for (i = 0; i < m; ++i)
        Vscanf("%lf",&s[i]);
      Vscanf("%lf",&dmin_);
      Vscanf("%lf",&dstep);
      Vscanf("%ld",&nsym);

      /* Compute the distance matrix */
      g03eac(update, dist, scale, n, m, &x[0][0], tdx, isx, s, d, NAGERR_DEFAULT);

      /* Perform clustering */
      g03ecc(method, n, d, ilc, iuc, cd, iord, dord, NAGERR_DEFAULT);
      /* Produce dendrograms */

      g03ehc(Nag_DendEast, n, dord, dmin_, dstep, nsym, &c, NAGERR_DEFAULT);

      Vprintf("\nDendrogram, Orientation East\n\n");
      for (i=0; i<n; i++)
        {
          Vprintf("%s\n", c[i]);
        }

      Vscanf("%lf",&dmin_);
      Vscanf("%lf",&dstep);
      Vscanf("%ld",&nsym);
      g03xzc(&c);
      g03ehc(Nag_DendSouth, n, dord, dmin_, dstep, nsym, &c, NAGERR_DEFAULT);
      Vprintf("\n\n Dendrogram, Orientation South\n\n");
      for (i=0; i<nsym; i++)
        {
          Vprintf("%s\n", c[i]);
        }
      g03xzc(&c);
      return EXIT_SUCCESS;
    }
    else
    {
      Vprintf("Incorrect input value of n or m.\n");
      return EXIT_FAILURE;
    }
}