howard_cycle_ratio.hpp File Reference

The implementation of the maximum/minimum cycle ratio/mean algorithm. More...

#include <vector>
#include <list>
#include <algorithm>
#include <limits>
#include <boost/bind.hpp>
#include <boost/type_traits/is_same.hpp>
#include <boost/type_traits/remove_const.hpp>
#include <boost/concept_check.hpp>
#include <boost/pending/queue.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/graph_concepts.hpp>
#include <boost/concept/assert.hpp>

Include dependency graph for howard_cycle_ratio.hpp:

Classes
struct	boost::mcr_float< Float >
	The mcr_float is like numeric_limits, but only for floating point types and only defines infinity() and epsilon(). More...
struct	boost::detail::min_comparator_props< FloatTraits >
struct	boost::detail::max_comparator_props< FloatTraits >
struct	boost::detail::float_wrapper< FloatTraits, ComparatorProps >
class	boost::detail::mcr_howard< FloatTraits, Graph, VertexIndexMap, EdgeWeight1, EdgeWeight2 >
	Calculates optimum (maximum/minimum) cycle ratio of a directed graph. More...
class	boost::detail::mcr_howard1< FloatTraits, Graph, VertexIndexMap, EdgeWeight1, EdgeWeight2 >
	Finds optimum cycle raio and a critical cycle. More...

Namespaces
	boost
	Duration formatting facet for input.
	boost::detail

Functions
template<typename FT , typename TG , typename TVIM , typename TEW1 , typename TEW2 , typename EV >
FT::value_type	boost::detail::optimum_cycle_ratio (const TG &g, TVIM vim, TEW1 ewm, TEW2 ew2m, EV *pcc)
template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >
FloatTraits::value_type	boost::maximum_cycle_ratio (const Graph &g, VertexIndexMap vim, EdgeWeight1Map ew1m, EdgeWeight2Map ew2m, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0, FloatTraits=FloatTraits())
template<typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >
double	boost::maximum_cycle_ratio (const Graph &g, VertexIndexMap vim, EdgeWeight1Map ew1m, EdgeWeight2Map ew2m, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0)
template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >
FloatTraits::value_type	boost::minimum_cycle_ratio (const Graph &g, VertexIndexMap vim, EdgeWeight1Map ew1m, EdgeWeight2Map ew2m, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0, FloatTraits=FloatTraits())
template<typename Graph , typename VertexIndexMap , typename EdgeWeight1Map , typename EdgeWeight2Map >
double	boost::minimum_cycle_ratio (const Graph &g, VertexIndexMap vim, EdgeWeight1Map ew1m, EdgeWeight2Map ew2m, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0)
template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >
FloatTraits::value_type	boost::maximum_cycle_mean (const Graph &g, VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0, FloatTraits ft=FloatTraits())
template<typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >
double	boost::maximum_cycle_mean (const Graph &g, VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0)
template<typename FloatTraits , typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >
FloatTraits::value_type	boost::minimum_cycle_mean (const Graph &g, VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0, FloatTraits ft=FloatTraits())
template<typename Graph , typename VertexIndexMap , typename EdgeWeightMap , typename EdgeIndexMap >
double	boost::minimum_cycle_mean (const Graph &g, VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, std::vector< typename graph_traits< Graph >::edge_descriptor > *pcc=0)

Detailed Description

The implementation of the maximum/minimum cycle ratio/mean algorithm.

Author

Dmitry Bufistov

Andrey Parfenov