boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-02-27 17:12:11 +00:00
Code Issues Projects Releases Wiki Activity

Fixed bind ambiguity; fixes #3569

Browse Source 
[SVN r57177]
This commit is contained in:
Jeremiah Willcock
2009-10-27 18:05:50 +00:00
parent b237a6ee82
commit 76083c7e67
1 changed files with 8 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
include/boost/graph/howard_cycle_ratio.hpp
View File

@@ -216,10 +216,10 @@ namespace boost {
tie(oei, oeie) = out_edges(*vi, m_g);
typename graph_traits<Graph>::out_edge_iterator mei =
std::max_element(oei, oeie,
bind(m_cmp,
bind(&EdgeWeight1::operator[], m_ew1m, _1),
bind(&EdgeWeight1::operator[], m_ew1m, _2)
)
boost::bind(m_cmp,
boost::bind(&EdgeWeight1::operator[], m_ew1m, _1),
boost::bind(&EdgeWeight1::operator[], m_ew1m, _2)
)
);
if (mei == oeie)
{
@@ -334,10 +334,10 @@ namespace boost {
tie(uv_itr, vie) = vertices(m_g);
float_t mcr = m_bound;
while ( (uv_itr = std::find_if(uv_itr, vie,
bind(std::equal_to<my_color_type>(),
my_white,
bind(&color_map_t::operator[], vcm_, _1)
)
boost::bind(std::equal_to<my_color_type>(),
my_white,
boost::bind(&color_map_t::operator[], vcm_, _1)
)
)
) != vie )
///While there are undiscovered vertices