Vcsn
2.0
Be Rational
|
#include <queue>
#include <unordered_map>
#include <vcsn/algos/accessible.hh>
#include <vcsn/algos/compose.hh>
#include <vcsn/algos/distance.hh>
#include <vcsn/algos/is-ambiguous.hh>
#include <vcsn/dyn/automaton.hh>
#include <vcsn/dyn/fwd.hh>
#include <vcsn/labelset/tupleset.hh>
#include <vcsn/misc/unordered_map.hh>
#include <vcsn/misc/unordered_set.hh>
Go to the source code of this file.
Namespaces | |
vcsn | |
vcsn::dyn | |
FIXME: duplicate code with determinize. | |
vcsn::dyn::detail | |
Functions | |
template<typename Aut > | |
weight_t_of< Aut > | vcsn::shortest_distance_to_finals (Aut aut, state_t_of< Aut > s0) |
Find shorhest of s0 to the final states of aut by using single source shortest distance. More... | |
template<typename Aut > | |
std::unordered_map< state_t_of < Aut >, weight_t_of< Aut > > | vcsn::shortest_distance_to_finals (Aut aut) |
Find all shortest distance of each state to the final states of aut. More... | |
template<typename Aut > | |
auto | vcsn::push_weights (const Aut &aut) -> decltype(::vcsn::copy(aut)) |
The algorithm weight pushing. More... | |
template<typename Aut > | |
automaton | vcsn::dyn::detail::push_weights (const automaton &aut) |
Bridge. More... | |
vcsn::dyn::detail::REGISTER_DECLARE (push_weights,(const automaton &aut) -> automaton) | |