forked from mirror/toddcox-faster
aa3d3b5149
Removing the path checks on Cosets::set drastically improves performance. E7 is now <1s and B8 is now <5s.
20 lines
416 B
C++
20 lines
416 B
C++
#include "tc/core.hpp"
|
|
#include "tc/groups.hpp"
|
|
|
|
#include <iostream>
|
|
|
|
int main() {
|
|
auto cube = tc::group::B<3>();
|
|
auto vars = tc::solve(cube);
|
|
|
|
std::string start;
|
|
std::vector<std::string> names = {"a", "b", "c"};
|
|
auto words = vars.path().walk(start, names, std::plus<>());
|
|
|
|
for (const auto &word: words) {
|
|
std::cout << (word.empty() ? "-" : word) << std::endl;
|
|
}
|
|
|
|
return 0;
|
|
}
|