/* Link Strength Calculator v1.4*/
/* Copyright 1995 by Travis Dahl */

/* This program will accept a series of routings (quantity + workstations) */
/* Then it will calculate (by quantity) the number of times a link between */
/* two workstations was used.  (Hopefully. <grin>) */

/* v1.4: now printf "." instead of "0" in output */
/* v1.3.2: now checks for consecutive dupes, output is comma delimited */
/* instead of space-delimited */
/* v1.3.1: increased defined variables by 1 (except for stations) */
/* v1.3: increased stations (to 11) for layout, increased max_stations, */
/* max_rtgs for new tests; added function to get rid of dupe processes */
/* eg. saw-lathe-lathe-burr */
/* v1.2.1: changed data output so that data is labeled */
/* v1.2: attempted to stop "segmentation fault" error, data wasn't being */
/* read in correcly (sometimes routings split between rows of matrix) */
/* v1.1: fixed two minor problems (Wasn't using 0 column, Couldn't detect */
/* last routing) */

#include <stdio.h>

/* Remember to change max_rtgs and max_stations after testing */
#define max_rtgs 184
#define max_stations 21
#define stations 11

/* Function Prototypes */
int check_data(void);
void link_check(void);

/* Global variables */
long int rtgs[max_rtgs][max_stations];
int links[10*stations+9][10*stations+9];
/* Note: the links array is set up like links[from][to] */
int count;

void main(void)
{
   /* declare variables (just like going through customs) */
   int i1, i2, data_bad, fred;

   /* Zero Arrays & initialize Variables*/
   for (i1=0; i1<max_rtgs; i1++)
      for (i2=0; i2<max_stations; i2++)
         rtgs[i1][i2]=(-1);
   fred=10*stations+9;
   for (i1=0; i1<(fred); i1++)
      for (i2=0; i2<(fred); i2++)
      links[i1][i2]=0;
   data_bad=0;

   /* input Data */
   count=0;
   i2=0;
   while ((scanf("%d", &i1))!=EOF)
     {
      rtgs[count][i2]=i1;
      i2=i2+1;
      if (i1==10)
	{	     
         count=count+1;
	 i2=0;
	}
     }
   
   /* Check that the data is set up right */
   data_bad=check_data();

   /* if there are no data errors, count the links*/
   if (data_bad!=0)
     {
      /* Do it */
      link_check();
      /* Print it */
      /* Okay, for the moment, i'm going to set this up so that, if screen */
      /* captured, the info could be read as space-delimited by MS Excel */
      printf (",");
      for (i1=0; i1<(fred); i1++)
	  printf ("%d,", i1);
      printf ("\n");
      for (i1=0; i1<(fred); i1++)
        {
	 printf ("%d,", i1);
         for (i2=0; i2<(fred); i2++)
	   if (links[i1][i2]!=0)
             printf ("%d,", links[i1][i2]);
	   else
	     printf (".,");
         printf ("\n");
        }
     }
   /* Otherwise, tell the user there were problems */
   else
      printf ("\nThere was an error in the data.  Unable to execute program.\nCorrect and try again.");
}

int check_data(void)
/* insure that the data is in the proper format, etc. */
{
   /* Declare and initialize Variables */
   int i1, i2, i3, i4, dummy, err_flag;
   int check[12];
   err_flag=0;
   for (i1=0; i1<12; i1++)
     check[i1]=0;
   
   /* Check the quantities for num<1 */
   for (i1=0; i1<count; i1++)
      if (rtgs[i1][0]<1)
        {
         printf ("\nError!  Bad quantity in routing %d\n", i1);
         err_flag=1;
        }

   if (err_flag==0)
     {
	/* Check routings for consecutive dupes and fix them */
	for (i1=0; i1<count; i1++)
	  {
	     dummy=(-1);
	     while (i2>(-1))
	       {
		  /* If the station is repeated more than 4 times, it won't */
		  /* get caugh by this */
		  for (i3=0; i3<4; i3++)
		    if (rtgs[i1][i2]==dummy)
		    {
		       /* Delete dupe and shrink routing */
		       for (i4=i2; i4<max_stations; i4++)
		       	 rtgs[i1][i4]=rtgs[i1][(i4+1)];
		       rtgs[i1][max_stations]=(-1);
		    }
		  dummy=rtgs[i1][i2];
		  i2=i2+1;
	       }
	  }
      /* Check the routings for dupes, etc. */
      /* This currently operates under the assumption that there no workstations two in a row */
      /* eg.  they don't go saw-lathe-lathe-burr, but saw-lathe-burr */
      /* Support for this may come later */
      /* Also, holes (saw-  -lathe-burr) don't cause errors */
      for (i1=0; i1<count; i1++)
        {
         /* Zero check array for each routing */
         for (i2=0; i2<12; i2++)
            check[i2]=0;
         /* Check a routing */
         for (i2=1; i2<max_stations; i2++)
           {
            dummy=rtgs[i1][i2];
            if (check[dummy]==0)
               check[dummy]=1;
            else
              {
               /* This will increase the counter and change the routing to the form process-number */
               check[dummy]=check[dummy]+1;
               rtgs[i1][i2]=dummy*10+check[dummy];
              }
           }   
        }
     }
	
   return err_flag;
}

void link_check(void)
/* This is what counts the link loading */
{
   /* Declare */
   int prev, curr, i1, i2;

   /* Loop to check every routing */
   for (i1=0; i1<count; i1++)
     {
      prev=0;
      for (i2=1; i2<max_stations; i2++)
        {
         /* Only check link if workstations are present */
         if (rtgs[i1][i2]>(-1))
           {
            curr=rtgs[i1][i2];
            links[prev][curr]=links[prev][curr]+rtgs[i1][0];
            prev=curr;
           }
         /* Make sure last work stations is Pack */
         else if ((rtgs[i1][i2]==(-1)) && (prev!=10))
           {
            printf ("\nError!  Last work stations was not Pack(547) in line %d\n", i1);
           }
        }
     }
}