![]() |
Vcsn
2.8
Be Rational
|
#include <vector>#include <vcsn/misc/fibonacci_heap.hh>#include <vcsn/misc/unordered_map.hh>#include <vcsn/algos/path.hh>#include <vcsn/algos/shortest-path-tree.hh>#include <vcsn/algos/implicit-path.hh>Go to the source code of this file.
Classes | |
| class | vcsn::detail::eppstein< Aut > |
| Eppstein implementation of the K shortest path problem adapted to Vcsn. More... | |
Namespaces | |
| vcsn | |
| vcsn::detail | |
Functions | |
| template<Automaton Aut> | |
| std::vector< detail::path< Aut > > | vcsn::compute_eppstein (const Aut &aut, state_t_of< Aut > src, state_t_of< Aut > dst, unsigned num) |
| Compute the num lightest paths in the automaton aut from src to dst. More... | |