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 "is-transf.hpp"
29#include "kambites-class.hpp"
30#include "knuth-bendix-class.hpp"
31#include "konieczny.hpp"
32#include "todd-coxeter-class.hpp"
34#include "detail/kbe.hpp"
35#include "detail/ke.hpp"
36#include "detail/tce.hpp"
107 template <
template <
typename...>
typename Thing,
typename Word>
108 auto to(Congruence<Word>& cong)
144 template <
template <
typename...>
typename Thing,
typename Word>
145 auto to(Kambites<Word>& k) -> std::enable_if_t<
179 template <
template <
typename...>
typename Thing,
182 typename ReductionOrder>
183 auto to(KnuthBendix<Word, Rewriter, ReductionOrder>& kb) -> std::enable_if_t<
210 template <
template <
typename...>
typename Thing,
249 template <
template <
typename...>
typename Thing>
250 auto to(detail::ToddCoxeterImpl& tc) -> std::enable_if_t<
315 template <
typename Result,
typename Node>
318 std::is_same_v<FroidurePin<typename Result::element_type>, Result>,
329 template <
typename Result,
typename Node>
331 std::is_same_v<FroidurePin<typename Result::element_type>, Result>,
333 return to<Result>(wg, 0, wg.number_of_nodes());
337#include "to-froidure-pin.tpp"
Class implementing the Froidure-Pin algorithm.
Definition froidure-pin.hpp:190
Class implementing Konieczny's algorithm.
Definition konieczny.hpp:178
Class for representing word graphs.
Definition word-graph.hpp:83
Namespace for everything in the libsemigroups library.
Definition action.hpp:44
auto to(detail::KnuthBendixImpl< Rewriter, ReductionOrder > &kb) -> std::enable_if_t< std::is_same_v< Presentation< typename Result::word_type >, Result >, Result >
No doc.