minor corrections
This commit is contained in:
parent
1f031db03e
commit
baf050ee3c
46
counts
Normal file
46
counts
Normal file
@ -0,0 +1,46 @@
|
|||||||
|
1 2 1 A1
|
||||||
|
2 6 1 A2
|
||||||
|
2 8 2 B2
|
||||||
|
2 12 2 G2
|
||||||
|
2 4 2 A1A1
|
||||||
|
3 24 10 A3
|
||||||
|
3 48 29 B3
|
||||||
|
3 12 5 A1A2
|
||||||
|
3 16 7 A1B2
|
||||||
|
3 24 10 A1G2
|
||||||
|
3 8 4 A1A1A1
|
||||||
|
4 120 4608 A4
|
||||||
|
4 384 49404510 B4
|
||||||
|
4 192 114964 D4
|
||||||
|
# 4 1152 ? F4
|
||||||
|
4 36 50 A2A2
|
||||||
|
4 48 118 A2B2
|
||||||
|
4 72 342 A2G2
|
||||||
|
4 64 336 B2B2
|
||||||
|
4 96 1410 B2G2
|
||||||
|
4 144 10516 G2G2
|
||||||
|
4 48 116 A1A3
|
||||||
|
4 96 1042 A1B3
|
||||||
|
4 24 23 A1A1A2
|
||||||
|
4 32 40 A1A1B2
|
||||||
|
4 48 86 A1A1G2
|
||||||
|
4 16 12 A1A1A1A1
|
||||||
|
# 5 720 ? A5
|
||||||
|
# 5 3840 ? B5
|
||||||
|
# 5 1920 ? D5
|
||||||
|
5 240 15591709 A1A4
|
||||||
|
# 5 768 ? A1B4
|
||||||
|
# 5 384 ? A1D4
|
||||||
|
# 5 2304 ? A1F4
|
||||||
|
5 114 167866 A2A3
|
||||||
|
5 192 2805798 B2A3
|
||||||
|
5 288 168775572 G2A3
|
||||||
|
5 288 105122719 A2B3
|
||||||
|
5 384 9576339067 B2B3
|
||||||
|
# 5 576 ? G2B3
|
||||||
|
5 96 7676 A1A1A3
|
||||||
|
5 192 545430 A1A1B3
|
||||||
|
5 96 3856 A1A1A1G2
|
||||||
|
5 64 854 A1A1A1B2
|
||||||
|
5 48 308 A1A1A1A2
|
||||||
|
5 32 81 A1A1A1A1A1
|
BIN
counts.pdf
Normal file
BIN
counts.pdf
Normal file
Binary file not shown.
@ -330,7 +330,7 @@ void enumerate_balanced_thickenings(semisimple_type_t type, node_t *graph, const
|
|||||||
level[head] = HEAD_MARKER;
|
level[head] = HEAD_MARKER;
|
||||||
while(current_level > 0) {
|
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;
|
is_slim = 1;
|
||||||
queue_init(&queue);
|
queue_init(&queue);
|
||||||
level[graph[head].opposite] = -current_level;
|
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) {
|
if(is_fat) {
|
||||||
// ERROR(count >= MAX_THICKENINGS, "Too many balanced thickenings! Increase MAX_THICKENINGS\n");
|
// ERROR(count >= MAX_THICKENINGS, "Too many balanced thickenings! Increase MAX_THICKENINGS\n");
|
||||||
//if(count % 10000000 == 0)
|
if(count % 1 == 0)
|
||||||
//print_thickening(rank, order, level, 0, 0, 0, alphabet, stderr);
|
print_thickening(rank, order, level, 0, 0, 0, alphabet, stderr);
|
||||||
fwrite(level, sizeof(signed char), order, outfile);
|
fwrite(level, sizeof(signed char), order, outfile);
|
||||||
count++;
|
count++;
|
||||||
}
|
}
|
||||||
|
Loading…
Reference in New Issue
Block a user