|
typedef mcr_howard
< FloatTraits, Graph,
VertexIndexMap, EdgeWeight1,
EdgeWeight2 > | inhr_t |
|
enum | my_color_type {
my_white = 0,
my_black
} |
|
typedef FloatTraits::value_type | float_t |
|
typedef
FloatTraits::comparator_props_t | cmp_props_t |
|
typedef FloatTraits::comparator | comparator_t |
|
typedef graph_traits< Graph >
::vertex_descriptor | vertex_t |
|
typedef graph_traits< Graph >
::edge_descriptor | edge_t |
|
typedef graph_traits< Graph >
::vertices_size_type | vn_t |
|
typedef std::vector< float_t > | vp_t |
|
typedef
boost::iterator_property_map
< typename vp_t::iterator,
VertexIndexMap > | distance_map_t |
|
typedef std::vector< edge_t > | ve_t |
|
typedef std::vector
< my_color_type > | vcol_t |
|
typedef
::boost::iterator_property_map
< typename ve_t::iterator,
VertexIndexMap > | policy_t |
|
typedef
::boost::iterator_property_map
< typename vcol_t::iterator,
VertexIndexMap > | color_map_t |
|
typedef std::list< vertex_t > | pinel_t |
|
typedef std::vector< pinel_t > | inedges1_t |
|
typedef
::boost::iterator_property_map
< typename
inedges1_t::iterator,
VertexIndexMap > | inedges_t |
|
typedef std::vector< edge_t > | critical_cycle_t |
|
typedef
boost::iterator_property_map
< std::vector< int >::iterator,
VertexIndexMap > | badv_t |
|
template<typename FloatTraits, typename Graph, typename VertexIndexMap, typename EdgeWeight1, typename EdgeWeight2>
class boost::detail::mcr_howard1< FloatTraits, Graph, VertexIndexMap, EdgeWeight1, EdgeWeight2 >
Finds optimum cycle raio and a critical cycle.