/* nag_sparse_nsym_sort (f11zac) Example Program.
 *
 * Copyright 1998 Numerical Algorithms Group.
 *
 * Mark 5, 1998.
 *
 */

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

int main(void)
{
  double               *a = 0;
  Integer              *icol = 0;
  Integer              *irow = 0, *istr = 0;
  Integer              exit_status = 0, i, n, nnz;
  Nag_SparseNsym_Zeros zero;
  Nag_SparseNsym_Dups  dup;
  NagError             fail;

  INIT_FAIL(fail);

  printf("nag_sparse_nsym_sort (f11zac) Example Program Results\n");

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

  /* Read order of matrix and number of non-zero entries */
  scanf("%ld%*[^\n]", &n);
  scanf("%ld%*[^\n]", &nnz);

  /* Allocate memory */
  istr = NAG_ALLOC(n+1, Integer);
  a = NAG_ALLOC(nnz, double);
  irow = NAG_ALLOC(nnz, Integer);
  icol = NAG_ALLOC(nnz, Integer);

  if (!istr || !irow || !icol || !a)
    {
      printf("Allocation failure\n");
      exit_status = -1;
      goto END;
    }

  /* Read and output the original non-zero elements */
  for (i = 1; i <= nnz; ++i)
    scanf("%lf%ld%ld%*[^\n]", &a[i-1], &irow[i-1], &icol[i-1]);

  printf(" Original elements \n");
  printf(" nnz =  %6ld\n", nnz);
  for (i = 1; i <= nnz; ++i)
    printf(" %8ld%16.4e%8ld%8ld\n", i, a[i-1],
           irow[i-1], icol[i-1]);

  /* Reorder, sum duplicates and remove zeros */

  dup = Nag_SparseNsym_SumDups;
  zero = Nag_SparseNsym_RemoveZeros;

  /* nag_sparse_nsym_sort (f11zac).
   * Sparse sort (nonsymmetric)
   */
  nag_sparse_nsym_sort(n, &nnz, a, irow, icol, dup, zero, istr, &fail);
  if (fail.code != NE_NOERROR)
    {
      printf("Error from nag_sparse_nsym_sort (f11zac).\n%s\n",
             fail.message);
      exit_status = 1;
      goto END;
    }

  /* Output results */
  printf(" Reordered elements \n");
  printf(" nnz = %4ld\n", nnz);

  for (i = 1; i <= nnz; ++i)
    printf(" %8ld%16.4e%8ld%8ld\n", i, a[i-1],
           irow[i-1], icol[i-1]);

 END:
  if (istr) NAG_FREE(istr);
  if (irow) NAG_FREE(irow);
  if (icol) NAG_FREE(icol);
  if (a) NAG_FREE(a);

  return exit_status;
}