Vcsn  2.4
Be Rational
k-lightest-path.hh File Reference
#include <algorithm>
#include <boost/heap/fibonacci_heap.hpp>
#include <vcsn/weightset/weightset.hh>
#include <vcsn/algos/dijkstra.hh>
#include <vcsn/core/mutable-automaton.hh>
#include <vcsn/algos/filter.hh>
Include dependency graph for k-lightest-path.hh:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  vcsn::yen_tag
 Yen implementation. More...
 
struct  vcsn::detail::yen_impl< Aut, ValueSet, Mul, GetValue >
 Yen implementation of the K lightest automaton algorithm. More...
 
struct  vcsn::detail::yen_impl< Aut, ValueSet, Mul, GetValue >::profile
 

Namespaces

 vcsn
 
 vcsn::detail
 

Functions

template<Automaton Aut, typename ValueSet , typename Mul , typename GetValue >
auto vcsn::detail::make_yen (const Aut &aut, const ValueSet &vs, Mul mul, GetValue get_value)
 
template<Automaton Aut>
std::vector< path_t_of< Aut > > vcsn::k_lightest_path (const Aut &aut, state_t_of< Aut > src, state_t_of< Aut > dst, unsigned k)
 
template<Automaton Aut>
predecessors_t_of< Aut > vcsn::format_lightest (const Aut &aut, const std::vector< transition_t_of< Aut >> &path)
 A state-indexed vector of predecessor transitions from the path path. More...
 
template<Automaton Aut>
predecessors_t_of< Aut > vcsn::lightest_path (const Aut &aut, state_t_of< Aut > src, state_t_of< Aut > dst, yen_tag)