most_likely_paths.hpp File Reference

Most likely paths graph algorithm. More...

#include <boost/probability.hpp>
#include <boost/graph/dag_shortest_paths.hpp>

Go to the source code of this file.

Namespaces
namespace	boost
namespace	boost::probabilities
namespace	boost::probabilities::detail
Classes
struct	boost::probabilities::detail::mpy< T, U >
Functions
template<typename VertexListGraph, typename WeightMap, typename DistanceMap, typename PredecessorMap, typename ColorMap, typename IndexMap>
void	boost::probabilities::most_likely_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, WeightMap weight, DistanceMap distance, PredecessorMap pred, ColorMap color, IndexMap id)
	Most likely paths algorithm.
template<typename VertexListGraph, typename WeightMap, typename DistanceMap, typename IndexMap, typename Param, typename Tag, typename Rest>
void	boost::probabilities::detail::dispatch (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, WeightMap weight, DistanceMap distance, IndexMap id, const bgl_named_params< Param, Tag, Rest > &params)
template<typename VertexListGraph, typename Param, typename Tag, typename Rest>
void	boost::probabilities::most_likely_paths (const VertexListGraph &g, typename graph_traits< VertexListGraph >::vertex_descriptor s, const bgl_named_params< Param, Tag, Rest > &params)
	Most likely paths graph algorithm.

---

Detailed Description

Most likely paths graph algorithm.

---