florian/enumerate-balanced-ideals
1
0
Fork 0
Code Issues Pull Requests Releases Activity

minor corrections

Browse Source
This commit is contained in:
Florian Stecker
2016-10-07 12:25:36 +02:00
parent 1f031db03e
commit baf050ee3c
3 changed files with 49 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
thickenings.c
View File

@@ -330,7 +330,7 @@ void enumerate_balanced_thickenings(semisimple_type_t type, node_t *graph, const
level[head] = HEAD_MARKER;
while(current_level > 0) {
// calculate transitive closure; that is, fill current_level in every spot which must be marked with the current hat (but was not already before), and -current_level in every opposite spot (including opposite to the head)
// calculate transitive closure; that is, fill current_level in every spot which must be marked with the current head (but was not already marked before), and -current_level in every opposite spot (including opposite to the head)
is_slim = 1;
queue_init(&queue);
level[graph[head].opposite] = -current_level;
@@ -375,8 +375,8 @@ void enumerate_balanced_thickenings(semisimple_type_t type, node_t *graph, const
if(is_fat) {
// ERROR(count >= MAX_THICKENINGS, "Too many balanced thickenings! Increase MAX_THICKENINGS\n");
//if(count % 10000000 == 0)
//print_thickening(rank, order, level, 0, 0, 0, alphabet, stderr);
if(count % 1 == 0)
print_thickening(rank, order, level, 0, 0, 0, alphabet, stderr);
fwrite(level, sizeof(signed char), order, outfile);
count++;
}