Vcsn  2.3a
Be Rational
lightest-path.hh File Reference
Include dependency graph for lightest-path.hh:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces

 vcsn
 
 vcsn::detail
 

Functions

template<Automaton Aut, typename Tag = auto_tag>
std::vector< transition_t_of< Aut > > vcsn::lightest_path (const Aut &aut, Tag tag={})
 Lightest path dispatch between algorithms with tags. More...
 
template<Automaton Aut>
std::vector< transition_t_of< Aut > > vcsn::lightest_path (const Aut &aut, state_t_of< Aut > source, state_t_of< Aut > dest, auto_tag={})
 
template<Automaton Aut, typename Tag >
std::vector< transition_t_of< Aut > > vcsn::detail::lightest_path_tag (const Aut &aut, state_t_of< Aut > src, state_t_of< Aut > dst)
 Tag-based dispatch on implementation. More...
 
template<Automaton Aut>
std::vector< transition_t_of< Aut > > vcsn::lightest_path (const Aut &aut, state_t_of< Aut > src, state_t_of< Aut > dst, const std::string &algo)
 Lightest path dispatch between algorithms with string. More...
 
template<Automaton Aut>
auto vcsn::path_monomial (const Aut &aut, const std::vector< transition_t_of< Aut >> &path, state_t_of< Aut > src=Aut::element_type::pre(), state_t_of< Aut > dst=Aut::element_type::post()) -> boost::optional< typename detail::word_polynomialset_t< context_t_of< Aut >>::monomial_t >
 Given a path (typically computed by lightest_path), the corresponding monomial (label, weight). More...