lightest.hh File Reference

#include <algorithm>
#include <deque>
#include <fstream>
#include <boost/heap/binomial_heap.hpp>
#include <boost/optional.hpp>
#include <vcsn/ctx/context.hh>
#include <vcsn/dyn/automaton.hh>
#include <vcsn/dyn/fwd.hh>
#include <vcsn/dyn/polynomial.hh>
#include <vcsn/labelset/word-polynomialset.hh>

Include dependency graph for lightest.hh:

Go to the source code of this file.

Classes
class	vcsn::detail::weighter< Aut >
	The lightest algorithm computes the paths between pre and post with the smallest weight possible. More...
struct	vcsn::detail::weighter< Aut >::datum_less

Namespaces
	vcsn
	vcsn::detail
	vcsn::dyn
	vcsn::dyn::detail

Functions
template<typename Automaton >
detail::weighter< Automaton >::polynomial_t	vcsn::lightest (const Automaton &aut, boost::optional< unsigned > num={})
	The approximated behavior of an automaton. More...
template<typename Automaton >
detail::weighter< Automaton >::polynomial_t	vcsn::weigh (const Automaton &aut)
	The approximated behavior of an automaton. More...
template<typename Aut , typename Num >
polynomial	vcsn::dyn::detail::lightest (const automaton &aut, boost::optional< unsigned > num)
	Bridge. More...