![]() |
Vcsn
2.3a
Be Rational
|
#include <algorithm>
#include <iostream>
#include <limits>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <boost/range/algorithm/max_element.hpp>
#include <vcsn/algos/copy.hh>
#include <vcsn/ctx/context.hh>
#include <vcsn/dyn/value.hh>
#include <vcsn/misc/deque.hh>
#include <vcsn/misc/pair.hh>
#include <vcsn/misc/queue.hh>
#include <vcsn/weightset/nmin.hh>
Go to the source code of this file.
Namespaces | |
vcsn | |
Functions | |
template<Automaton Aut> | |
std::vector< weight_t_of< Aut > > | vcsn::ss_shortest_distance (const Aut &aut, state_t_of< Aut > s0) |
Single source shortest distance. More... | |
template<Automaton Aut> | |
std::unordered_map< state_t_of< Aut >, std::pair< unsigned, transition_t_of< Aut > > > | vcsn::paths_ibfs (const Aut &aut, const std::vector< state_t_of< Aut >> &start) |
Find the shortest paths from some states to all the states. More... | |
template<Automaton Aut> | |
std::vector< std::vector< weight_t_of< Aut > > > | vcsn::all_distances (const Aut &aut) |