Vcsn
2.0
Be Rational
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <vcsn/algos/copy.hh>
#include <vcsn/ctx/context.hh>
#include <vcsn/dyn/label.hh>
#include <vcsn/misc/pair.hh>
Go to the source code of this file.
Namespaces | |
vcsn | |
Functions | |
template<typename Aut > | |
std::unordered_map< state_t_of < Aut >, weight_t_of< Aut > > | vcsn::ss_shortest_distance (Aut aut, state_t_of< Aut > s0) |
Single source shortest distance. More... | |
template<typename Aut > | |
std::unordered_map< state_t_of < Aut >, std::pair< unsigned, transition_t_of< Aut > > > | vcsn::paths_ibfs (const Aut &aut, std::vector< state_t_of< Aut >> start) |
template<typename Aut > | |
std::vector< transition_t_of < Aut > > | vcsn::path_bfs (const Aut &aut, state_t_of< Aut > start, state_t_of< Aut > end) |
A shortest path between two states. More... | |