Thanks a bunch for your help Line ________________________________________ Fra: boost-users-bounces@lists.boost.org [boost-users-bounces@lists.boost.org] På vegne af Gábor Szuromi [kukkerman@gmail.com] Sendt: 27. april 2010 02:00 Til: boost-users@lists.boost.org Emne: Re: [Boost-users] [BGL] Filtered_graph edgepredicate Hi! You only need one template argument: the color map. The other types (color and edge descriptor) can be deduced from the property map: template <typename EdgeColourMap> struct same_edge_colour { same_edge_colour(): t_colour(){ } same_edge_colour(typename EdgeColourMap::value_type a, EdgeColourMap m) : t_colour(a),m_colours(m){ } bool operator()(const typename EdgeColourMap::key_type& e) const { return boost::get(m_colours,e)==t_colour; } typename EdgeColourMap::value_type t_colour; EdgeColourMap m_colours; }; Cheers, Gabe _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users