Vcsn
2.2
Be Rational
|
#include <algorithm>
#include <map>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <boost/range/algorithm/permutation.hpp>
#include <boost/range/algorithm/sort.hpp>
#include <vcsn/algos/accessible.hh>
#include <vcsn/dyn/automaton.hh>
#include <vcsn/dyn/fwd.hh>
#include <vcsn/misc/functional.hh>
#include <vcsn/misc/map.hh>
#include <vcsn/misc/vector.hh>
Go to the source code of this file.
Classes | |
class | vcsn::are_isomorphicer< Aut1, Aut2 > |
struct | vcsn::are_isomorphicer< Aut1, Aut2 >::full_response |
A datum specifying if two given automata are isomorphic, and why if they are not. More... | |
Namespaces | |
vcsn | |
vcsn::dyn | |
vcsn::dyn::detail | |
Macros | |
#define | HASH_TRANSITIONS(expression, endpoint_getter) |
Functions | |
template<Automaton Aut1, Automaton Aut2> | |
bool | vcsn::are_isomorphic (const Aut1 &a1, const Aut2 &a2) |
template<Automaton Aut1, Automaton Aut2> | |
bool | vcsn::dyn::detail::are_isomorphic (const automaton &aut1, const automaton &aut2) |
Bridge. More... | |
#define HASH_TRANSITIONS | ( | expression, | |
endpoint_getter | |||
) |
Referenced by vcsn::are_isomorphicer< Aut1, Aut2 >::state_to_class().