This page contains documentation related to the implementation of the Todd-Coxeter algorithm [17] in libsemigroups.
The purpose of this algorithm is to find the WordGraph of the action of a semigroup or monoid on the classes of a 1-sided (right), or 2-sided congruence; see [17] for more details.
Topics | |
| to<ToddCoxeter> | |
| Convert to ToddCoxeter instance. | |
| ToddCoxeter class | |
| Class containing an implementation of the Todd-Coxeter Algorithm. | |
| ToddCoxeter helper functions | |
| Helper functions for the ToddCoxeter class. | |
Functions | |
| template<typename Word> | |
| std::string | to_human_readable_repr (ToddCoxeter< Word > const &tc) |
| Return a human readable representation of a ToddCoxeter object. | |
| std::string to_human_readable_repr | ( | ToddCoxeter< Word > const & | tc | ) |
Defined in todd-coxeter-class.hpp.
This function returns a human readable representation of a ToddCoxeter object.
| tc | the ToddCoxeter object. |