distance.hh File Reference

#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/label.hh>
#include <vcsn/misc/algorithm.hh>
#include <vcsn/misc/deque.hh>
#include <vcsn/misc/pair.hh>
#include <vcsn/weightset/nmin.hh>

Include dependency graph for distance.hh:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	vcsn::state_distancer< Aut, WeightSet >
	Wrapper struct to provide the state distance function. More...
struct	vcsn::state_distancer< Aut, nmin >
	Struct specialization for nmin. More...

Namespaces
	vcsn

Functions
template<typename 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<typename 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<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...
template<typename Aut >
std::vector< std::vector< weight_t_of< Aut > > >	vcsn::all_distances (const Aut &aut)