![]() |
Vcsn
2.4
Be Rational
|
#include <algorithm>
#include <deque>
#include <fstream>
#include <boost/heap/binomial_heap.hpp>
#include <vcsn/algos/lightest-path.hh>
#include <vcsn/algos/has-lightening-cycle.hh>
#include <vcsn/core/name-automaton.hh>
#include <vcsn/ctx/context.hh>
#include <vcsn/dyn/automaton.hh>
#include <vcsn/dyn/fwd.hh>
#include <vcsn/dyn/value.hh>
#include <vcsn/labelset/word-polynomialset.hh>
Go to the source code of this file.
Classes | |
class | vcsn::detail::lightest_impl< Aut > |
The lightest algorithm computes the paths between pre and post with the smallest weight possible. More... | |
struct | vcsn::detail::lightest_impl< Aut >::profile_less |
Namespaces | |
vcsn | |
vcsn::detail | |
vcsn::dyn | |
vcsn::dyn::detail | |
Functions | |
template<Automaton Aut> | |
detail::word_polynomialset_t < context_t_of< Aut > >::value_t | vcsn::lightest (const Aut &aut, unsigned num=1, const std::string &algo="auto") |
The approximated behavior of an automaton. More... | |
template<Automaton Aut, typename Num , typename String > | |
polynomial | vcsn::dyn::detail::lightest (const automaton &aut, unsigned num, const std::string &algo) |
Bridge. More... | |