enumerate/enumerate_label_tree.cpp

• View this file on GitHub
• Last update: 2026-02-02 17:55:32+08:00
• Link: View error logs on GitHub Actions

Verified with

• test/mytest_auxiliary_tree.test.cpp
• test/mytest_tree.test.cpp
• test/mytest_tree_diameter.test.cpp

Code

//#include "tree/prufer_recover.cpp"
//#include "enumerate/enumerate_bit.cpp"
//#include "enumerate/enumerate_twelvefold.cpp"

template<typename F>
requires invocable<F, vector<vector<int>>>
void enumerate_label_tree(int n, F f) {
  assert(n > 0);
  if (n == 1) {
    f(vector<vector<int>>(1));
  } else {
    enumerate_cartesian_power(n, n - 2, [n, f](vector<int> a) {
      f(adjacency_list<false>(n, prufer_recover(a), 0));
    });
  }
}

#line 1 "enumerate/enumerate_label_tree.cpp"
//#include "tree/prufer_recover.cpp"
//#include "enumerate/enumerate_bit.cpp"
//#include "enumerate/enumerate_twelvefold.cpp"

template<typename F>
requires invocable<F, vector<vector<int>>>
void enumerate_label_tree(int n, F f) {
  assert(n > 0);
  if (n == 1) {
    f(vector<vector<int>>(1));
  } else {
    enumerate_cartesian_power(n, n - 2, [n, f](vector<int> a) {
      f(adjacency_list<false>(n, prufer_recover(a), 0));
    });
  }
}

Back to top page