19#ifndef LIBSEMIGROUPS_TO_FROIDURE_PIN_HPP_
20#define LIBSEMIGROUPS_TO_FROIDURE_PIN_HPP_
26#include "cong-class.hpp"
27#include "froidure-pin.hpp"
28#include "kambites-class.hpp"
29#include "knuth-bendix-class.hpp"
30#include "konieczny.hpp"
31#include "todd-coxeter-class.hpp"
33#include "detail/kbe.hpp"
34#include "detail/ke.hpp"
35#include "detail/tce.hpp"
104 template <
template <
typename...>
typename Thing,
typename Word>
105 auto to(Congruence<Word>& cong)
141 template <
template <
typename...>
typename Thing,
typename Word>
142 auto to(Kambites<Word>& k) -> std::enable_if_t<
176 template <
template <
typename...>
typename Thing,
178 typename ReductionOrder>
179 auto to(detail::KnuthBendixImpl<Rewriter, ReductionOrder>& kb)
183 detail::KBE<detail::KnuthBendixImpl<Rewriter, ReductionOrder>>>>;
208 template <
template <
typename...>
typename Thing,
247 template <
template <
typename...>
typename Thing>
248 auto to(detail::ToddCoxeterImpl& tc) -> std::enable_if_t<
313 template <
typename Result,
typename Node>
316 std::is_same_v<FroidurePin<typename Result::element_type>, Result>,
327 template <
typename Result,
typename Node>
329 std::is_same_v<FroidurePin<typename Result::element_type>, Result>,
331 return to<Result>(wg, 0, wg.number_of_nodes());
335#include "to-froidure-pin.tpp"
Class implementing the Froidure-Pin algorithm.
Definition froidure-pin.hpp:188
Class implementing Konieczny's algorithm.
Definition konieczny.hpp:179
Class for representing word graphs.
Definition word-graph.hpp:82
auto to(detail::KnuthBendixImpl< Rewriter, ReductionOrder > &kb) -> std::enable_if_t< std::is_same_v< Presentation< typename Result::word_type >, Result >, Result >
No doc.
Namespace for everything in the libsemigroups library.
Definition action.hpp:44