-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgraph.cc
executable file
·5552 lines (4710 loc) · 156 KB
/
graph.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include <cstdio>
#include <cassert>
#include <climits>
#include <set>
#include <list>
#include <algorithm>
#include "defs.hh"
#include "timer.hh"
#include "graph.hh"
#include "partition.hh"
#include "utils.hh"
/*
Copyright (c) 2003-2015 Tommi Junttila
Released under the GNU Lesser General Public License version 3.
This file is part of bliss.
bliss is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, version 3 of the License.
bliss is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with bliss. If not, see <http://www.gnu.org/licenses/>.
*/
namespace bliss_digraphs {
#define _INTERNAL_ERROR() fatal_error("%s:%d: internal error",__FILE__,__LINE__)
#define _OUT_OF_MEMORY() fatal_error("%s:%d: out of memory",__FILE__,__LINE__)
/*-------------------------------------------------------------------------
*
* Constructor and destructor routines for the abstract graph class
*
*-------------------------------------------------------------------------*/
AbstractGraph::AbstractGraph()
{
/* Initialize stuff */
in_search = false;
/* Default value for using "long prune" */
opt_use_long_prune = true;
/* Default value for using failure recording */
opt_use_failure_recording = true;
/* Default value for using component recursion */
opt_use_comprec = true;
verbose_level = 0;
verbstr = stdout;
report_hook = 0;
report_user_param = 0;
}
AbstractGraph::~AbstractGraph()
{
if (p.cr_enabled) {
p.cr_free();
}
report_hook = 0;
report_user_param = 0;
}
/*-------------------------------------------------------------------------
*
* Verbose output management routines
*
*-------------------------------------------------------------------------*/
void
AbstractGraph::set_verbose_level(const unsigned int level)
{
verbose_level = level;
}
void
AbstractGraph::set_verbose_file(FILE* const fp)
{
verbstr = fp;
}
/*-------------------------------------------------------------------------
*
* Routines for refinement to equitable partition
*
*-------------------------------------------------------------------------*/
void
AbstractGraph::refine_to_equitable()
{
/* Start refinement from all cells -> push 'em all in the splitting queue */
for(Partition::Cell* cell = p.first_cell; cell; cell = cell->next)
p.splitting_queue_add(cell);
do_refine_to_equitable();
}
void
AbstractGraph::refine_to_equitable(Partition::Cell* const unit_cell)
{
p.splitting_queue_add(unit_cell);
do_refine_to_equitable();
}
void
AbstractGraph::refine_to_equitable(Partition::Cell* const unit_cell1,
Partition::Cell* const unit_cell2)
{
p.splitting_queue_add(unit_cell1);
p.splitting_queue_add(unit_cell2);
do_refine_to_equitable();
}
bool
AbstractGraph::do_refine_to_equitable()
{
eqref_hash.reset();
while(!p.splitting_queue_is_empty())
{
Partition::Cell* const cell = p.splitting_queue_pop();
if(cell->is_unit())
{
if(in_search) {
const unsigned int index = cell->first;
if(!first_path_automorphism_vec.empty())
{
/* Build the (potential) automorphism on-the-fly */
first_path_automorphism[first_path_labeling_inv[index]] =
p.elements[index];
}
if(!best_path_automorphism_vec.empty())
{
/* Build the (potential) automorphism on-the-fly */
best_path_automorphism[best_path_labeling_inv[index]] =
p.elements[index];
}
}
const bool worse = split_neighbourhood_of_unit_cell(cell);
if(in_search and worse)
goto worse_exit;
}
else
{
const bool worse = split_neighbourhood_of_cell(cell);
if(in_search and worse)
goto worse_exit;
}
}
return true;
worse_exit:
/* Clear splitting_queue */
p.splitting_queue_clear();
return false;
}
/*-------------------------------------------------------------------------
*
* Routines for handling the canonical labeling
*
*-------------------------------------------------------------------------*/
/** \internal
* Assign the labeling induced by the current partition 'this.p' to
* \a labeling.
* That is, if the partition is [[2,0],[1]],
* then \a labeling will map 0 to 1, 1 to 2, and 2 to 0.
*/
void
AbstractGraph::update_labeling(uint_pointer_substitute const labeling)
{
const unsigned int N = get_nof_vertices();
uint_pointer_substitute ep = p.elements;
for(unsigned int i = 0; i < N; i++, ep++)
labeling[*ep] = i;
}
/** \internal
* The same as update_labeling() except that the inverse of the labeling
* is also produced and assigned to \a labeling_inv.
*/
void
AbstractGraph::update_labeling_and_its_inverse(uint_pointer_substitute const labeling,
uint_pointer_substitute const labeling_inv)
{
const unsigned int N = get_nof_vertices();
uint_pointer_substitute ep = p.elements;
uint_pointer_substitute clip = labeling_inv;
for(unsigned int i = 0; i < N; ) {
labeling[*ep] = i;
i++;
*clip = *ep;
ep++;
clip++;
}
}
/*-------------------------------------------------------------------------
*
* Routines for handling automorphisms
*
*-------------------------------------------------------------------------*/
/** \internal
* Reset the permutation \a perm to the identity permutation.
*/
void
AbstractGraph::reset_permutation(uint_pointer_substitute perm)
{
const unsigned int N = get_nof_vertices();
for(unsigned int i = 0; i < N; i++, perm++)
*perm = i;
}
bool
AbstractGraph::is_automorphism(uint_pointer_substitute const)
{
_INTERNAL_ERROR();
return false;
}
bool
AbstractGraph::is_automorphism(const std::vector<unsigned int>&) const
{
_INTERNAL_ERROR();
return false;
}
/*-------------------------------------------------------------------------
*
* Certificate building
*
*-------------------------------------------------------------------------*/
void
AbstractGraph::cert_add(const unsigned int v1,
const unsigned int v2,
const unsigned int v3)
{
if(refine_compare_certificate)
{
if(refine_equal_to_first)
{
/* So far equivalent to the first path... */
unsigned int index = certificate_current_path.size();
if(index >= refine_first_path_subcertificate_end)
{
refine_equal_to_first = false;
}
else if(certificate_first_path[index] != v1)
{
refine_equal_to_first = false;
}
else if(certificate_first_path[++index] != v2)
{
refine_equal_to_first = false;
}
else if(certificate_first_path[++index] != v3)
{
refine_equal_to_first = false;
}
if(opt_use_failure_recording and !refine_equal_to_first)
{
/* We just became different from the first path,
* remember the deviation point tree-specific invariant
* for the use of failure recording */
UintSeqHash h;
h.update(v1);
h.update(v2);
h.update(v3);
h.update(index);
h.update(eqref_hash.get_value());
failure_recording_fp_deviation = h.get_value();
}
}
if(refine_cmp_to_best == 0)
{
/* So far equivalent to the current best path... */
unsigned int index = certificate_current_path.size();
if(index >= refine_best_path_subcertificate_end)
{
refine_cmp_to_best = 1;
}
else if(v1 > certificate_best_path[index])
{
refine_cmp_to_best = 1;
}
else if(v1 < certificate_best_path[index])
{
refine_cmp_to_best = -1;
}
else if(v2 > certificate_best_path[++index])
{
refine_cmp_to_best = 1;
}
else if(v2 < certificate_best_path[index])
{
refine_cmp_to_best = -1;
}
else if(v3 > certificate_best_path[++index])
{
refine_cmp_to_best = 1;
}
else if(v3 < certificate_best_path[index])
{
refine_cmp_to_best = -1;
}
}
if((refine_equal_to_first == false) and
(refine_cmp_to_best < 0))
return;
}
/* Update the current path certificate */
certificate_current_path.push_back(v1);
certificate_current_path.push_back(v2);
certificate_current_path.push_back(v3);
}
void
AbstractGraph::cert_add_redundant(const unsigned int v1,
const unsigned int v2,
const unsigned int v3)
{
return cert_add(v1, v2, v3);
}
/*-------------------------------------------------------------------------
*
* Long prune code
*
*-------------------------------------------------------------------------*/
void
AbstractGraph::long_prune_init()
{
const unsigned int N = get_nof_vertices();
long_prune_temp.clear();
long_prune_temp.resize(N);
/* Of how many automorphisms we can store information in
the predefined, fixed amount of memory? */
const unsigned int nof_fitting_in_max_mem =
(long_prune_options_max_mem * 1024 * 1024) / (((N * 2) / 8)+1);
long_prune_max_stored_autss = long_prune_options_max_stored_auts;
/* Had some problems with g++ in using (a<b)?a:b when constants involved,
so had to make this in a stupid way... */
if(nof_fitting_in_max_mem < long_prune_options_max_stored_auts)
long_prune_max_stored_autss = nof_fitting_in_max_mem;
long_prune_deallocate();
long_prune_fixed.resize(N);
long_prune_mcrs.resize(N);
long_prune_begin = 0;
long_prune_end = 0;
}
void AbstractGraph::long_prune_deallocate() {
for (std::vector<std::vector<bool> >::iterator it = long_prune_fixed.begin();
it < long_prune_fixed.end();
++it) {
it->clear();
}
for (std::vector<std::vector<bool> >::iterator it = long_prune_mcrs.begin();
it < long_prune_mcrs.end();
++it) {
it->clear();
}
}
void
AbstractGraph::long_prune_swap(const unsigned int i, const unsigned int j)
{
const unsigned int real_i = i % long_prune_max_stored_autss;
const unsigned int real_j = j % long_prune_max_stored_autss;
std::swap(long_prune_fixed[real_i], long_prune_fixed[real_j]);
std::swap(long_prune_mcrs[real_i], long_prune_mcrs[real_j]);
}
std::vector<bool>&
AbstractGraph::long_prune_allocget_fixed(const unsigned int index)
{
const unsigned int i = index % long_prune_max_stored_autss;
if(long_prune_fixed[i].size() < get_nof_vertices())
long_prune_fixed[i].resize(get_nof_vertices());
return long_prune_fixed[i];
}
std::vector<bool>&
AbstractGraph::long_prune_get_fixed(const unsigned int index)
{
return long_prune_fixed[index % long_prune_max_stored_autss];
}
std::vector<bool>&
AbstractGraph::long_prune_allocget_mcrs(const unsigned int index)
{
const unsigned int i = index % long_prune_max_stored_autss;
if(long_prune_mcrs[i].size() < get_nof_vertices())
long_prune_mcrs[i].resize(get_nof_vertices());
return long_prune_mcrs[i];
}
std::vector<bool>&
AbstractGraph::long_prune_get_mcrs(const unsigned int index)
{
return long_prune_mcrs[index % long_prune_max_stored_autss];
}
void
AbstractGraph::long_prune_add_automorphism(uint_pointer_to_const_substitute aut)
{
if(long_prune_max_stored_autss == 0)
return;
const unsigned int N = get_nof_vertices();
/* If the buffer of stored auts is full, remove the oldest aut */
if(long_prune_end - long_prune_begin == long_prune_max_stored_autss)
{
long_prune_begin++;
}
long_prune_end++;
std::vector<bool>& fixed = long_prune_allocget_fixed(long_prune_end-1);
std::vector<bool>& mcrs = long_prune_allocget_mcrs(long_prune_end-1);
/* Mark nodes that are (i) fixed or (ii) minimal orbit representatives
* under the automorphism 'aut' */
for(unsigned int i = 0; i < N; i++)
{
fixed[i] = (aut[i] == i);
if(long_prune_temp[i] == false)
{
mcrs[i] = true;
unsigned int j = aut[i];
while(j != i)
{
long_prune_temp[j] = true;
j = aut[j];
}
}
else
{
mcrs[i] = false;
}
/* Clear the temp array on-the-fly... */
long_prune_temp[i] = false;
}
}
/*-------------------------------------------------------------------------
*
* Routines for handling orbit information
*
*-------------------------------------------------------------------------*/
void
AbstractGraph::update_orbit_information(Orbit& o, uint_pointer_substitute perm)
{
const unsigned int N = get_nof_vertices();
for(unsigned int i = 0; i < N; i++)
if(perm[i] != i)
o.merge_orbits(i, perm[i]);
}
/*-------------------------------------------------------------------------
*
* The actual backtracking search
*
*-------------------------------------------------------------------------*/
class TreeNode
{
//friend class AbstractGraph;
public:
unsigned int split_cell_first;
int split_element;
static const int SPLIT_START = -1;
static const int SPLIT_END = -2;
Partition::BacktrackPoint partition_bt_point;
unsigned int certificate_index;
static const char NO = -1;
static const char MAYBE = 0;
static const char YES = 1;
/* First path stuff */
bool fp_on;
bool fp_cert_equal;
char fp_extendable;
/* Best path stuff */
bool in_best_path;
int cmp_to_best_path;
unsigned int failure_recording_ival;
/* Component recursion related data */
unsigned int cr_cep_stack_size;
unsigned int cr_cep_index;
unsigned int cr_level;
bool needs_long_prune;
unsigned int long_prune_begin;
std::set<unsigned int, std::less<unsigned int> > long_prune_redundant;
UintSeqHash eqref_hash;
unsigned int subcertificate_length;
};
typedef struct {
unsigned int splitting_element;
unsigned int certificate_index;
unsigned int subcertificate_length;
UintSeqHash eqref_hash;
} PathInfo;
void
AbstractGraph::search(const bool canonical, Stats& stats)
{
const unsigned int N = get_nof_vertices();
unsigned int all_same_level = UINT_MAX;
p.graph = this;
/*
* Must be done!
*/
remove_duplicate_edges();
/*
* Reset search statistics
*/
stats.reset();
stats.nof_nodes = 1;
stats.nof_leaf_nodes = 1;
/* Free old first path data structures */
first_path_labeling_vec.clear();
first_path_labeling_inv_vec.clear();
first_path_automorphism_vec.clear();
/* Free old best path data structures */
best_path_labeling_vec.clear();
best_path_labeling_inv_vec.clear();
best_path_automorphism_vec.clear();
if(N == 0)
{
/* Nothing to do, return... */
return;
}
/* Initialize the partition ... */
p.init(N);
/* ... and the component recursion data structures in the partition */
if(opt_use_comprec)
p.cr_init();
neighbour_heap.init(N);
in_search = false;
/* Do not compute certificate when building the initial partition */
refine_compare_certificate = false;
/* The 'eqref_hash' hash value is not computed when building
* the initial partition as it is not used for anything at the moment.
* This saves some cycles. */
compute_eqref_hash = false;
Timer timer1;
make_initial_equitable_partition();
if(verbstr and verbose_level >= 2)
{
fprintf(verbstr, "Initial partition computed in %.2f seconds\n",
timer1.get_duration());
fflush(verbstr);
}
/*
* Allocate space for the "first path" and "best path" labelings
*/
first_path_labeling_vec.clear();
first_path_labeling_vec.resize(N, 0);
first_path_labeling = first_path_labeling_vec.begin();
best_path_labeling_vec.clear();
best_path_labeling_vec.resize(N, 0);
best_path_labeling = best_path_labeling_vec.begin();
/*
* Is the initial partition discrete?
*/
if(p.is_discrete())
{
/* Make the best path labeling i.e. the canonical labeling */
update_labeling(best_path_labeling);
/* Update statistics */
stats.nof_leaf_nodes = 1;
return;
}
/*
* Allocate the inverses of the "first path" and "best path" labelings
*/
first_path_labeling_inv_vec.clear();
first_path_labeling_inv_vec.resize(N, 0);
first_path_labeling_inv = first_path_labeling_inv_vec.begin();
best_path_labeling_inv_vec.clear();
best_path_labeling_inv_vec.resize(N, 0);
best_path_labeling_inv = best_path_labeling_inv_vec.begin();
/*
* Allocate space for the automorphisms
*/
first_path_automorphism_vec.clear();
first_path_automorphism_vec.resize(N);
first_path_automorphism = first_path_automorphism_vec.begin();
best_path_automorphism_vec.clear();
best_path_automorphism_vec.resize(N);
best_path_automorphism = best_path_automorphism_vec.begin();
/*
* Initialize orbit information so that all vertices are in their own orbits
*/
first_path_orbits.init(N);
best_path_orbits.init(N);
/*
* Initialize certificate memory
*/
initialize_certificate();
std::vector<TreeNode> search_stack;
std::vector<PathInfo> first_path_info;
std::vector<PathInfo> best_path_info;
search_stack.clear();
/* Initialize "long prune" data structures */
if(opt_use_long_prune)
long_prune_init();
/*
* Initialize failure recording data structures
*/
typedef std::set<unsigned int, std::less<unsigned int> > FailureRecordingSet;
std::vector<FailureRecordingSet> failure_recording_hashes;
/*
* Initialize component recursion data structures
*/
cr_cep_stack.clear();
unsigned int cr_cep_index = 0;
{
/* Inset a sentinel "component end point" */
CR_CEP sentinel;
sentinel.creation_level = 0;
sentinel.discrete_cell_limit = get_nof_vertices();
sentinel.next_cr_level = 0;
sentinel.next_cep_index = 0;
sentinel.first_checked = false;
sentinel.best_checked = false;
cr_cep_index = 0;
cr_cep_stack.push_back(sentinel);
}
cr_level = 0;
if(opt_use_comprec and
nucr_find_first_component(cr_level) == true and
p.nof_discrete_cells() + cr_component_elements <
cr_cep_stack[cr_cep_index].discrete_cell_limit)
{
cr_level = p.cr_split_level(0, cr_component);
CR_CEP cep;
cep.creation_level = 0;
cep.discrete_cell_limit = p.nof_discrete_cells() + cr_component_elements;
cep.next_cr_level = 0;
cep.next_cep_index = cr_cep_index;
cep.first_checked = false;
cep.best_checked = false;
cr_cep_index = cr_cep_stack.size();
cr_cep_stack.push_back(cep);
}
/*
* Build the root node of the search tree
*/
{
TreeNode root;
Partition::Cell* split_cell = find_next_cell_to_be_splitted(p.first_cell);
root.split_cell_first = split_cell->first;
root.split_element = TreeNode::SPLIT_START;
root.partition_bt_point = p.set_backtrack_point();
root.certificate_index = 0;
root.fp_on = true;
root.fp_cert_equal = true;
root.fp_extendable = TreeNode::MAYBE;
root.in_best_path = false;
root.cmp_to_best_path = 0;
root.long_prune_begin = 0;
root.failure_recording_ival = 0;
/* Save component recursion info for backtracking */
root.cr_level = cr_level;
root.cr_cep_stack_size = cr_cep_stack.size();
root.cr_cep_index = cr_cep_index;
search_stack.push_back(root);
}
/*
* Set status and global flags for search related procedures
*/
in_search = true;
/* Do not compare certificates during refinement until the first path has been traversed to the leaf */
refine_compare_certificate = false;
/*
* The actual backtracking search
*/
while(!search_stack.empty())
{
TreeNode& current_node = search_stack.back();
const unsigned int current_level = (unsigned int)search_stack.size()-1;
if(opt_use_comprec)
{
CR_CEP& cep = cr_cep_stack[current_node.cr_cep_index];
if(cep.first_checked == true and
current_node.fp_extendable == TreeNode::MAYBE and
!search_stack[cep.creation_level].fp_on)
{
current_node.fp_extendable = TreeNode::NO;
}
}
if(current_node.fp_on)
{
if(current_node.split_element == TreeNode::SPLIT_END)
{
search_stack.pop_back();
continue;
}
}
else
{
if(current_node.fp_extendable == TreeNode::YES)
{
search_stack.pop_back();
continue;
}
if(current_node.split_element == TreeNode::SPLIT_END)
{
if(opt_use_failure_recording)
{
TreeNode& parent_node = search_stack[current_level-1];
if(parent_node.fp_on)
failure_recording_hashes[current_level-1].insert(current_node.failure_recording_ival);
}
search_stack.pop_back();
continue;
}
if(current_node.fp_extendable == TreeNode::NO and
(!canonical or current_node.cmp_to_best_path < 0))
{
if(opt_use_failure_recording)
{
TreeNode& parent_node = search_stack[current_level-1];
if(parent_node.fp_on)
failure_recording_hashes[current_level-1].insert(current_node.failure_recording_ival);
}
search_stack.pop_back();
continue;
}
}
/* Restore partition ... */
p.goto_backtrack_point(current_node.partition_bt_point);
/* ... and re-remember backtracking point */
current_node.partition_bt_point = p.set_backtrack_point();
/* Restore current path certificate */
certificate_index = current_node.certificate_index;
refine_current_path_certificate_index = current_node.certificate_index;
certificate_current_path.resize(certificate_index);
/* Fetch split cell information */
Partition::Cell * const cell =
p.get_cell(p.elements[current_node.split_cell_first]);
/* Restore component recursion information */
cr_level = current_node.cr_level;
cr_cep_stack.resize(current_node.cr_cep_stack_size);
cr_cep_index = current_node.cr_cep_index;
/*
* Update long prune redundancy sets
*/
if(opt_use_long_prune and current_level >= 1 and !current_node.fp_on)
{
unsigned int begin = (current_node.long_prune_begin>long_prune_begin)?current_node.long_prune_begin:long_prune_begin;
for(unsigned int i = begin; i < long_prune_end; i++)
{
const std::vector<bool>& fixed = long_prune_get_fixed(i);
#if defined(BLISS_CONSISTENCY_CHECKS)
for(unsigned int l = 0; l < search_stack.size()-2; l++)
assert(fixed[search_stack[l].split_element]);
#endif
if(fixed[search_stack[search_stack.size()-1-1].split_element] ==
false)
{
long_prune_swap(begin, i);
begin++;
current_node.long_prune_begin = begin;
continue;
}
}
if(current_node.split_element == TreeNode::SPLIT_START)
{
current_node.needs_long_prune = true;
}
else if(current_node.needs_long_prune)
{
current_node.needs_long_prune = false;
begin = (current_node.long_prune_begin>long_prune_begin)?current_node.long_prune_begin:long_prune_begin;
for(unsigned int i = begin; i < long_prune_end; i++)
{
const std::vector<bool>& fixed = long_prune_get_fixed(i);
#if defined(BLISS_CONSISTENCY_CHECKS)
for(unsigned int l = 0; l < search_stack.size()-2; l++)
assert(fixed[search_stack[l].split_element]);
#endif
assert(fixed[search_stack[current_level-1].split_element] == true);
if(fixed[search_stack[current_level-1].split_element] == false)
{
long_prune_swap(begin, i);
begin++;
current_node.long_prune_begin = begin;
continue;
}
const std::vector<bool>& mcrs = long_prune_get_mcrs(i);
uint_pointer_substitute ep = p.elements + cell->first;
for(unsigned int j = cell->length; j > 0; j--, ep++) {
if(mcrs[*ep] == false)
current_node.long_prune_redundant.insert(*ep);
}
}
}
}
/*
* Find the next smallest, non-isomorphic element in the cell and
* store it in current_node.split_element
*/
{
unsigned int next_split_element = UINT_MAX;
uint_pointer_substitute next_split_element_pos;
uint_pointer_substitute ep = p.elements + cell->first;
if(current_node.fp_on)
{
/* Find the next larger splitting element that is
* a minimal orbit representative w.r.t. first_path_orbits */
for(unsigned int i = cell->length; i > 0; i--, ep++) {
if((int)(*ep) > current_node.split_element and
*ep < next_split_element and
first_path_orbits.is_minimal_representative(*ep)) {
next_split_element = *ep;
next_split_element_pos = ep;
}
}
}
else if(current_node.in_best_path)
{
/* Find the next larger splitting element that is
* a minimal orbit representative w.r.t. best_path_orbits */
for(unsigned int i = cell->length; i > 0; i--, ep++) {
if((int)(*ep) > current_node.split_element and
*ep < next_split_element and
best_path_orbits.is_minimal_representative(*ep) and
(!opt_use_long_prune or
current_node.long_prune_redundant.find(*ep) ==
current_node.long_prune_redundant.end())) {
next_split_element = *ep;
next_split_element_pos = ep;
}
}
}
else
{
/* Find the next larger splitting element */
for(unsigned int i = cell->length; i > 0; i--, ep++) {
if((int)(*ep) > current_node.split_element and
*ep < next_split_element and
(!opt_use_long_prune or
current_node.long_prune_redundant.find(*ep) ==
current_node.long_prune_redundant.end())) {
next_split_element = *ep;
next_split_element_pos = ep;
}
}
}
if(next_split_element == UINT_MAX)
{
/* No more (unexplored children) in the cell */
current_node.split_element = TreeNode::SPLIT_END;