Update and rename DoAIGotSkills.c to Set-Covering-Problem.c

Author: YorgosBas

DoAIGotSkills.c Set-Covering-Problem.cDoAIGotSkills.c renamed to Set-Covering-Problem.c

@@ -1,22 +1,24 @@
 #include <stdio.h>
 #include "genlib.h"
 #include "simpio.h"
-
+//afairese = remove
+// red checks if universe is already in resault
+// yellow checks if universe is already traversed
 void afairesi(int a,int b,int pl,int number,int table[pl][number],int arxikoCount[pl],int uncoveredCount[pl],int metablitoCount[pl],int col_table[number],int keep);
 bool check(int pl,int uncoveredCount[pl]);
 bool red(int keep,int k,int pl,int number,int table[pl][number],int arxikoCount[pl],int uncoveredCount[pl],int metabalomenoCount[pl],int col_table[number]);
 bool yellow(int k,int keep,int pl,int uncoveredCount[pl],int metabalomenoCount[pl],int number,int col_table[number]);
-
+//import data
 int main(){
     int i,j,pl,number,ap;
-    printf("Dose sinoliko plithos atomon:");
+    printf("Give max sets(eg people)");
     scanf("%d",&pl);
-    printf("Dose sinolikes glosses programmatismou:");
+    printf("Give max universes(eg skills)");
     scanf("%d",&number);
     int table[pl][number];
     for(i=0; i<pl; i++){
         for(j=0; j<number; j++){
-            printf("o %d kserei tin glossa programmatismou %d: 0 OXI,1 NAI: ",i+1,j+1);
+            printf("person %d knows skill %d: 0 NO,1 YES: ",i+1,j+1);
             scanf("%d",&ap);
             table[i][j] = ap;
         }
@@ -47,10 +49,13 @@ int main(){
         arxikoCount[i] = uncoveredCount[i];
         metabalomenoCount[i] = uncoveredCount[i];
     }
+    
+    //code starts here
     int keep;
     int max,l;
     int m = 0;
     while(check(pl,uncoveredCount)){
+        //finds max number of skills in one set 
         max = uncoveredCount[0];
         keep = 0;
         for(j=1; j<pl; j++){
@@ -61,13 +66,15 @@ int main(){
         }
         resaultCover[m] = keep;
         m++;
+        //removes this universe from other sets
         afairesi(0,keep,pl,number,table,arxikoCount,uncoveredCount,metabalomenoCount,col_table,keep);
         afairesi(keep+1,pl,pl,number,table,arxikoCount,uncoveredCount,metabalomenoCount,col_table,keep);
         uncoveredCount[keep] = -100;
         for(l=0; l<pl; l++){
             metabalomenoCount[l] = arxikoCount[l];
         }
     }
+    //print results
     for(i=0; i<m; i++){
         printf("Accepted: %d\n",resaultCover[i]+1);
     }