573{
574 if (level == 0) return;
575
576
577
578
579
580
581
582
583
585 if (mypairs == nullptr) return;
586
588 res_pair *compare_num_list = mypairs->
first;
589 for (
p = mypairs->
first;
p !=
nullptr;
p =
p->next)
590 {
591 p->next_compare =
p->next;
593 }
595 resn[level]->compare_num_list =
597
598 int next = 0;
599 for (
p = resn[level]->compare_num_list;
p !=
nullptr;
p =
p->next_compare)
600 p->compare_num = next++;
601}
void sort_compares(res_pair *&p) const
res_degree * get_degree_set(int level, int d) const
res_pair * merge_compares(res_pair *f, res_pair *g) const