/* nag_superlu_column_permutation (f11mdc) Example Program.
 *
 * Copyright 2005 Numerical Algorithms Group.
 *
 * Mark 8, 2005.
 */

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

int main(int argc, char *argv[])
{
  FILE                      *fpin, *fpout;
  Integer                   exit_status = 0, i, n, nnz;
  Integer                   *icolzp = 0, *iprm = 0, *irowix = 0;
  /* Nag types */
  Nag_ColumnPermutationType ispec;
  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_superlu_column_permutation (f11mdc) Example Program Results"
    "\n\n");
  /* Skip heading in data file */
  fscanf(fpin, "%*[^\n] ");
  /* Read order of matrix */
  fscanf(fpin, "%ld%*[^\n] ", &n);
  if (!(icolzp = NAG_ALLOC(n+1, Integer)))
    {
      fprintf(fpout, "Allocation failure\n");
      exit_status = -1;
      goto END;
    }
  /* Read the matrix A */
  for (i = 1; i <= n+1; ++i) fscanf(fpin, "%ld%*[^\n] ", &icolzp[i - 1]);
  nnz = icolzp[n] - 1;
  if (!(irowix = NAG_ALLOC(nnz, Integer)) ||
      !(iprm = NAG_ALLOC(7*n, Integer)))
    {
      fprintf(fpout, "Allocation failure\n");
      exit_status = -1;
      goto END;
    }
  for (i = 1; i <= nnz; ++i) fscanf(fpin, "%ld%*[^\n] ", &irowix[i - 1]);
  /* Calculate COLAMD permutation */
  ispec = Nag_Sparse_Colamd;
  /* nag_superlu_column_permutation (f11mdc).
   * Real sparse nonsymmetric linear systems, setup for
   * nag_superlu_lu_factorize (f11mec)
   */
  nag_superlu_column_permutation(ispec, n, icolzp, irowix, iprm, &fail);
  if (fail.code != NE_NOERROR)
    {
      fprintf(fpout,
              "Error from nag_superlu_column_permutation (f11mdc).\n%s\n",
              fail.message);
      exit_status = 1;
      goto END;
    }

  /* Output results */
  fprintf(fpout, "\n");
  fprintf(fpout, "%s\n", "COLAMD Permutation");
  for (i = 1; i <= n; ++i)
    fprintf(fpout, "%6ld%s", iprm[i - 1], i%10 == 0 || i == n?"\n":" ");

  /* Calculate user permutation */
  ispec = Nag_Sparse_User;
  iprm[0] = 4;
  iprm[1] = 3;
  iprm[2] = 2;
  iprm[3] = 1;
  iprm[4] = 0;
  /* nag_superlu_column_permutation (f11mdc), see above. */
  nag_superlu_column_permutation(ispec, n, icolzp, irowix, iprm, &fail);
  if (fail.code != NE_NOERROR)
    {
      fprintf(fpout,
              "Error from nag_superlu_column_permutation (f11mdc).\n%s\n",
              fail.message);
      exit_status = 1;
      goto END;
    }
  /* Output results */
  fprintf(fpout, "\n");
  fprintf(fpout, "%s", "User Permutation");
  fprintf(fpout, "\n");
  for (i = 1; i <= n; ++i)
    fprintf(fpout, "%6ld%s", iprm[i - 1], i%10 == 0 || i == n?"\n":" ");

  /* Calculate natural permutation */
  ispec = Nag_Sparse_Identity;
  /* nag_superlu_column_permutation (f11mdc), see above. */
  nag_superlu_column_permutation(ispec, n, icolzp, irowix, iprm, &fail);
  if (fail.code != NE_NOERROR)
    {
      fprintf(fpout,
              "Error from nag_superlu_column_permutation (f11mdc).\n%s\n",
              fail.message);
      exit_status = 1;
      goto END;
    }
  /* Output results */
  fprintf(fpout, "\n");
  fprintf(fpout, "%s\n", "Natural Permutation");
  for (i = 1; i <= n; ++i)
    fprintf(fpout, "%6ld%s", iprm[i - 1], i%10 == 0 || i == n?"\n":" ");
  fprintf(fpout, "\n");

 END:
  if (fpin != stdin) fclose(fpin);
  if (fpout != stdout) fclose(fpout);
  if (icolzp) NAG_FREE(icolzp);
  if (iprm) NAG_FREE(iprm);
  if (irowix) NAG_FREE(irowix);

  return exit_status;
}