starting new triangulation technique. verified working with edges.

This commit is contained in:
2020-01-07 16:27:35 -05:00
parent 050475b66b
commit 7f73604075
5 changed files with 111 additions and 126 deletions

View File

@@ -15,7 +15,7 @@ namespace tc {
data[target * ngens + gen] = coset;
if (path[target].coset == -1) {
path[target] = {coset, gen};
path[target] = {coset, gen, target};
}
}
@@ -26,7 +26,7 @@ namespace tc {
data[target * ngens + gen] = coset;
if (path[target].coset == -1) {
path[target] = {coset, gen};
path[target] = {coset, gen, target};
}
}

View File

@@ -66,23 +66,6 @@ namespace tc {
return g;
}
Group Group::shrink(const std::vector<int> &gens) const {
Group g(ngens);
for (const auto &i : gens) {
for (const auto &j : gens) {
g._mults[i][j] = _mults[i][j];
}
}
std::stringstream ss;
ss << name << "{";
for (auto e : gens) ss << " " << e;
ss << " }";
g.name = ss.str();
return g;
}
bool Group::trivial() const {
for (int i = 0; i < ngens; ++i) {
for (int j = 0; j < ngens; ++j) {