Skip to content

Commit ae7b6d2

Browse files
committed
Remove the Roberts' library dependency.
1 parent cc05833 commit ae7b6d2

1 file changed

Lines changed: 10 additions & 15 deletions

File tree

SetCoveringProblem.c

Lines changed: 10 additions & 15 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
1+
#include <stdbool.h>
12
#include <stdio.h>
2-
#include "genlib.h"
3-
#include "simpio.h"
4-
//afairese = remove
3+
4+
//afairesi = remove
55
//red checks if universe is already in resault
66
//yellow checks if universe is already traversed
77
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);
@@ -84,10 +84,10 @@ int main(){
8484
bool check(int pl,int uncoveredCount[pl]){
8585
int i,count = 0;
8686
for(i=0; i<pl; i++){
87-
if(uncoveredCount[i]>0)count++;
87+
if(uncoveredCount[i]>0)
88+
return true;
8889
}
89-
if(count>0)return TRUE;
90-
else return FALSE;
90+
return false;
9191
}
9292

9393
void afairesi(int a,int b,int pl,int number,int table[pl][number],int arxikoCount[pl],int uncoveredCount[pl],int metabalomenoCount[pl],int col_table[number],int keep){
@@ -104,21 +104,16 @@ void afairesi(int a,int b,int pl,int number,int table[pl][number],int arxikoCoun
104104
}
105105

106106
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]){
107-
if(table[keep][k] == 1 && yellow(k,keep,pl,uncoveredCount,metabalomenoCount,number,col_table)){
108-
return TRUE;
109-
}
110-
else return FALSE;
107+
return table[keep][k] == 1 && yellow(k,keep,pl,uncoveredCount,metabalomenoCount,number,col_table);
111108
}
112109

113110
bool yellow(int k,int keep,int pl,int uncoveredCount[pl],int metabalomenoCount[pl],int number,int col_table[number]){
114111
if(metabalomenoCount[keep] != uncoveredCount[keep]){
115112
metabalomenoCount[keep]--;
116-
return TRUE;
117-
}
118-
else{
119-
if(col_table[k] == 1)return TRUE;
120-
return FALSE;
113+
return true;
121114
}
115+
else
116+
return col_table[k] == 1;
122117
}
123118

124119

0 commit comments

Comments
 (0)