k-lightest-path.hh File Reference

#include <algorithm>
#include <boost/algorithm/string/predicate.hpp>
#include <boost/range/algorithm/mismatch.hpp>
#include <boost/range/iterator_range_core.hpp>
#include <vcsn/algos/dijkstra.hh>
#include <vcsn/algos/filter.hh>
#include <vcsn/core/mutable-automaton.hh>
#include <vcsn/misc/fibonacci_heap.hh>
#include <vcsn/weightset/weightset.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's algorithm of the K lightest paths. 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)