Ticket #6780: mas_test_errors.txt

File mas_test_errors.txt, 65.1 KB (added by Jeremiah Willcock, 6 years ago)

Errors from testing with patch applied

Line 
1Performing configuration checks
2
3    - has_icu builds           : yes
4...patience...
5...patience...
6...patience...
7...patience...
8...found 9429 targets...
9...updating 4 targets...
10gcc.compile.c++ bin.v2/libs/graph/test/stoer_wagner_test.test/gcc-4.7.2/debug/stoer_wagner_test.o
11In file included from ./boost/graph/adjacency_list.hpp:245:0,
12                 from libs/graph/test/stoer_wagner_test.cpp:11:
13./boost/graph/detail/adjacency_list.hpp: In instantiation of ‘struct boost::detail::adj_list_any_edge_pmap::bind_<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::no_property, boost::edge_weight_t>’:
14./boost/graph/detail/adjacency_list.hpp:2685:12:   required from ‘struct boost::detail::adj_list_choose_edge_pmap<boost::edge_weight_t, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::no_property>’
15./boost/graph/detail/adjacency_list.hpp:2690:14:   required from ‘struct boost::detail::adj_list_edge_property_selector::bind_<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::no_property, boost::edge_weight_t>’
16./boost/graph/properties.hpp:208:12:   required from ‘struct boost::detail::edge_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::edge_weight_t>’
17./boost/graph/properties.hpp:228:10:   required from ‘struct boost::property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, boost::edge_weight_t>’
18./boost/graph/maximum_adjacency_search.hpp:238:7:   required from ‘struct boost::graph::detail::maximum_adjacency_search_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
19./boost/utility/result_of.hpp:65:1:   [ skipping 4 instantiation contexts ]
20./boost/utility/detail/result_of_iterate.hpp:146:8:   required from ‘struct boost::result_of<boost::graph::detail::maximum_adjacency_search_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >(boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, const boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::max_priority_queue, const boost::reference_wrapper<boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::root_vertex, const long unsigned int>, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::mas_min_cut_visitor<boost::associative_property_map<std::map<long unsigned int, bool> >, int, boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::weight_map, const boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> > > > >&)>’
21./boost/graph/maximum_adjacency_search.hpp:261:1:   required by substitution of ‘template<class Param0, class P, class T, class R> typename boost::result_of<boost::graph::detail::maximum_adjacency_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::maximum_adjacency_search(const Param0&, const boost::bgl_named_params<T, Tag, Base>&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; P = boost::reference_wrapper<boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> > >; T = boost::max_priority_queue_t; R = boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::detail::mas_min_cut_visitor<boost::associative_property_map<std::map<long unsigned int, bool> >, int, boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> >, boost::graph_visitor_t, boost::bgl_named_params<boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>, boost::edge_weight_t, boost::bgl_named_params<boost::associative_property_map<std::map<long unsigned int, long unsigned int> >, boost::vertex_assignment_map_t, boost::no_property> > > >]’
22./boost/graph/stoer_wagner_min_cut.hpp:148:9:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::detail::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
23./boost/graph/stoer_wagner_min_cut.hpp:198:68:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
24./boost/graph/stoer_wagner_min_cut.hpp:222:9:   required from ‘boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::operator()(const UndirectedGraph&, WeightMap, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type = int]’
25./boost/graph/stoer_wagner_min_cut.hpp:226:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::stoer_wagner_min_cut_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = int]’
26./boost/graph/stoer_wagner_min_cut.hpp:230:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::stoer_wagner_min_cut(const Param0&, const Param1&, const boost::bgl_named_params<P, T, R>&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; P = boost::associative_property_map<std::map<long unsigned int, bool> >; T = boost::parity_map_t; R = boost::bgl_named_params<boost::associative_property_map<std::map<long unsigned int, long unsigned int> >, boost::vertex_assignment_map_t, boost::no_property>; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type = int]’
27libs/graph/test/stoer_wagner_test.cpp:170:168:   required from here
28./boost/graph/detail/adjacency_list.hpp:2653:29: error: forming reference to void
29./boost/graph/detail/adjacency_list.hpp:2654:35: error: forming reference to void
30./boost/graph/detail/adjacency_list.hpp:2658:61: error: forming reference to void
31./boost/graph/detail/adjacency_list.hpp:2661:68: error: forming reference to void
32In file included from ./boost/graph/named_function_params.hpp:16:0,
33                 from ./boost/graph/depth_first_search.hpp:21,
34                 from ./boost/graph/connected_components.hpp:15,
35                 from libs/graph/test/stoer_wagner_test.cpp:12:
36./boost/utility/result_of.hpp: In instantiation of ‘struct boost::detail::result_of_nested_result<boost::graph::detail::maximum_adjacency_search_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::graph::detail::maximum_adjacency_search_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >(boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, const boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::max_priority_queue, const boost::reference_wrapper<boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::root_vertex, const long unsigned int>, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::mas_min_cut_visitor<boost::associative_property_map<std::map<long unsigned int, bool> >, int, boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::weight_map, const boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> > > > >&)>’:
37./boost/utility/result_of.hpp:170:8:   required from ‘struct boost::detail::tr1_result_of_impl<boost::graph::detail::maximum_adjacency_search_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >, boost::graph::detail::maximum_adjacency_search_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >(boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, const boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::max_priority_queue, const boost::reference_wrapper<boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::root_vertex, const long unsigned int>, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::mas_min_cut_visitor<boost::associative_property_map<std::map<long unsigned int, bool> >, int, boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::weight_map, const boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> > > > >&), false>’
38./boost/utility/detail/result_of_iterate.hpp:27:8:   required from ‘struct boost::tr1_result_of<boost::graph::detail::maximum_adjacency_search_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >(boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, const boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::max_priority_queue, const boost::reference_wrapper<boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::root_vertex, const long unsigned int>, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::mas_min_cut_visitor<boost::associative_property_map<std::map<long unsigned int, bool> >, int, boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::weight_map, const boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> > > > >&)>’
39./boost/utility/detail/result_of_iterate.hpp:146:8:   required from ‘struct boost::result_of<boost::graph::detail::maximum_adjacency_search_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >(boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, const boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::max_priority_queue, const boost::reference_wrapper<boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::root_vertex, const long unsigned int>, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::mas_min_cut_visitor<boost::associative_property_map<std::map<long unsigned int, bool> >, int, boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::weight_map, const boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> > > > >&)>’
40./boost/graph/maximum_adjacency_search.hpp:261:1:   required by substitution of ‘template<class Param0, class P, class T, class R> typename boost::result_of<boost::graph::detail::maximum_adjacency_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::maximum_adjacency_search(const Param0&, const boost::bgl_named_params<T, Tag, Base>&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; P = boost::reference_wrapper<boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> > >; T = boost::max_priority_queue_t; R = boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::detail::mas_min_cut_visitor<boost::associative_property_map<std::map<long unsigned int, bool> >, int, boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> >, boost::graph_visitor_t, boost::bgl_named_params<boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>, boost::edge_weight_t, boost::bgl_named_params<boost::associative_property_map<std::map<long unsigned int, long unsigned int> >, boost::vertex_assignment_map_t, boost::no_property> > > >]’
41./boost/graph/stoer_wagner_min_cut.hpp:148:9:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::detail::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
42./boost/graph/stoer_wagner_min_cut.hpp:198:68:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
43./boost/graph/stoer_wagner_min_cut.hpp:222:9:   required from ‘boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::operator()(const UndirectedGraph&, WeightMap, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type = int]’
44./boost/graph/stoer_wagner_min_cut.hpp:226:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::stoer_wagner_min_cut_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = int]’
45./boost/graph/stoer_wagner_min_cut.hpp:230:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::stoer_wagner_min_cut(const Param0&, const Param1&, const boost::bgl_named_params<P, T, R>&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; P = boost::associative_property_map<std::map<long unsigned int, bool> >; T = boost::parity_map_t; R = boost::bgl_named_params<boost::associative_property_map<std::map<long unsigned int, long unsigned int> >, boost::vertex_assignment_map_t, boost::no_property>; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type = int]’
46libs/graph/test/stoer_wagner_test.cpp:170:168:   required from here
47./boost/utility/result_of.hpp:166:8: error: no class template named ‘result’ in ‘struct boost::graph::detail::maximum_adjacency_search_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >’
48In file included from libs/graph/test/stoer_wagner_test.cpp:16:0:
49./boost/graph/stoer_wagner_min_cut.hpp: In instantiation of ‘typename boost::property_traits<ComponentMap>::value_type boost::detail::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’:
50./boost/graph/stoer_wagner_min_cut.hpp:198:68:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
51./boost/graph/stoer_wagner_min_cut.hpp:222:9:   required from ‘boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::operator()(const UndirectedGraph&, WeightMap, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type = int]’
52./boost/graph/stoer_wagner_min_cut.hpp:226:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::stoer_wagner_min_cut_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = int]’
53./boost/graph/stoer_wagner_min_cut.hpp:230:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::stoer_wagner_min_cut(const Param0&, const Param1&, const boost::bgl_named_params<P, T, R>&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; P = boost::associative_property_map<std::map<long unsigned int, bool> >; T = boost::parity_map_t; R = boost::bgl_named_params<boost::associative_property_map<std::map<long unsigned int, long unsigned int> >, boost::vertex_assignment_map_t, boost::no_property>; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type = int]’
54libs/graph/test/stoer_wagner_test.cpp:170:168:   required from here
55./boost/graph/stoer_wagner_min_cut.hpp:148:9: error: no matching function for call to ‘maximum_adjacency_search(const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>&, boost::bgl_named_params<boost::reference_wrapper<boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> > >, boost::max_priority_queue_t, boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::detail::mas_min_cut_visitor<boost::associative_property_map<std::map<long unsigned int, bool> >, int, boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> >, boost::graph_visitor_t, boost::bgl_named_params<boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>, boost::edge_weight_t, boost::bgl_named_params<boost::associative_property_map<std::map<long unsigned int, long unsigned int> >, boost::vertex_assignment_map_t, boost::no_property> > > > >)’
56./boost/graph/stoer_wagner_min_cut.hpp:148:9: note: candidates are:
57In file included from ./boost/graph/stoer_wagner_min_cut.hpp:18:0,
58                 from libs/graph/test/stoer_wagner_test.cpp:16:
59./boost/graph/maximum_adjacency_search.hpp:200:1: note: template<class Graph, class WeightMap, class MASVisitor, class VertexAssignmentMap, class KeyedUpdatablePriorityQueue> boost::tuples::tuple<typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, typename KeyedUpdatablePriorityQueue::key_type> boost::maximum_adjacency_search(const Graph&, WeightMap, MASVisitor, typename boost::graph_traits<Graph>::vertex_descriptor, VertexAssignmentMap, KeyedUpdatablePriorityQueue)
60./boost/graph/maximum_adjacency_search.hpp:200:1: note:   template argument deduction/substitution failed:
61In file included from libs/graph/test/stoer_wagner_test.cpp:16:0:
62./boost/graph/stoer_wagner_min_cut.hpp:148:9: note:   candidate expects 6 arguments, 2 provided
63In file included from ./boost/graph/stoer_wagner_min_cut.hpp:18:0,
64                 from libs/graph/test/stoer_wagner_test.cpp:16:
65./boost/graph/maximum_adjacency_search.hpp:261:1: note: template<class Param0, class P, class T, class R> typename boost::result_of<boost::graph::detail::maximum_adjacency_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::maximum_adjacency_search(const Param0&, const boost::bgl_named_params<T, Tag, Base>&)
66./boost/graph/maximum_adjacency_search.hpp:261:1: note:   substitution of deduced template arguments resulted in errors seen above
67./boost/graph/maximum_adjacency_search.hpp:261:1: note: template<class Param0> typename boost::result_of<boost::graph::detail::maximum_adjacency_search_impl<Param0>(Param0, const boost::parameter::aux::empty_arg_list&)>::type boost::maximum_adjacency_search(const Param0&)
68./boost/graph/maximum_adjacency_search.hpp:261:1: note:   template argument deduction/substitution failed:
69In file included from libs/graph/test/stoer_wagner_test.cpp:16:0:
70./boost/graph/stoer_wagner_min_cut.hpp:148:9: note:   candidate expects 1 argument, 2 provided
71./boost/graph/stoer_wagner_min_cut.hpp:163:7: error: no matching function for call to ‘maximum_adjacency_search(const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>&, boost::bgl_named_params<boost::reference_wrapper<boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> > >, boost::max_priority_queue_t, boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::detail::mas_min_cut_visitor<boost::associative_property_map<std::map<long unsigned int, bool> >, int, boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> >, boost::graph_visitor_t, boost::bgl_named_params<boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>, boost::edge_weight_t, boost::bgl_named_params<boost::associative_property_map<std::map<long unsigned int, long unsigned int> >, boost::vertex_assignment_map_t, boost::no_property> > > > >)’
72./boost/graph/stoer_wagner_min_cut.hpp:163:7: note: candidates are:
73In file included from ./boost/graph/stoer_wagner_min_cut.hpp:18:0,
74                 from libs/graph/test/stoer_wagner_test.cpp:16:
75./boost/graph/maximum_adjacency_search.hpp:200:1: note: template<class Graph, class WeightMap, class MASVisitor, class VertexAssignmentMap, class KeyedUpdatablePriorityQueue> boost::tuples::tuple<typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, typename KeyedUpdatablePriorityQueue::key_type> boost::maximum_adjacency_search(const Graph&, WeightMap, MASVisitor, typename boost::graph_traits<Graph>::vertex_descriptor, VertexAssignmentMap, KeyedUpdatablePriorityQueue)
76./boost/graph/maximum_adjacency_search.hpp:200:1: note:   template argument deduction/substitution failed:
77In file included from libs/graph/test/stoer_wagner_test.cpp:16:0:
78./boost/graph/stoer_wagner_min_cut.hpp:163:7: note:   candidate expects 6 arguments, 2 provided
79In file included from ./boost/graph/stoer_wagner_min_cut.hpp:18:0,
80                 from libs/graph/test/stoer_wagner_test.cpp:16:
81./boost/graph/maximum_adjacency_search.hpp:261:1: note: template<class Param0, class P, class T, class R> typename boost::result_of<boost::graph::detail::maximum_adjacency_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::maximum_adjacency_search(const Param0&, const boost::bgl_named_params<T, Tag, Base>&)
82./boost/graph/maximum_adjacency_search.hpp:261:1: note:   template argument deduction/substitution failed:
83./boost/graph/maximum_adjacency_search.hpp: In substitution of ‘template<class Param0, class P, class T, class R> typename boost::result_of<boost::graph::detail::maximum_adjacency_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::maximum_adjacency_search(const Param0&, const boost::bgl_named_params<T, Tag, Base>&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; P = boost::reference_wrapper<boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> > >; T = boost::max_priority_queue_t; R = boost::bgl_named_params<long unsigned int, boost::root_vertex_t, boost::bgl_named_params<boost::detail::mas_min_cut_visitor<boost::associative_property_map<std::map<long unsigned int, bool> >, int, boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> >, boost::graph_visitor_t, boost::bgl_named_params<boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>, boost::edge_weight_t, boost::bgl_named_params<boost::associative_property_map<std::map<long unsigned int, long unsigned int> >, boost::vertex_assignment_map_t, boost::no_property> > > >]’:
84./boost/graph/stoer_wagner_min_cut.hpp:163:7:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::detail::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
85./boost/graph/stoer_wagner_min_cut.hpp:198:68:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
86./boost/graph/stoer_wagner_min_cut.hpp:222:9:   required from ‘boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::operator()(const UndirectedGraph&, WeightMap, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type = int]’
87./boost/graph/stoer_wagner_min_cut.hpp:226:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::stoer_wagner_min_cut_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = int]’
88./boost/graph/stoer_wagner_min_cut.hpp:230:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::stoer_wagner_min_cut(const Param0&, const Param1&, const boost::bgl_named_params<P, T, R>&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; P = boost::associative_property_map<std::map<long unsigned int, bool> >; T = boost::parity_map_t; R = boost::bgl_named_params<boost::associative_property_map<std::map<long unsigned int, long unsigned int> >, boost::vertex_assignment_map_t, boost::no_property>; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type = int]’
89libs/graph/test/stoer_wagner_test.cpp:170:168:   required from here
90./boost/graph/maximum_adjacency_search.hpp:261:1: error: no type named ‘type’ in ‘struct boost::result_of<boost::graph::detail::maximum_adjacency_search_impl<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >(boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>, const boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::max_priority_queue, const boost::reference_wrapper<boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::root_vertex, const long unsigned int>, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::mas_min_cut_visitor<boost::associative_property_map<std::map<long unsigned int, bool> >, int, boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::weight_map, const boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> > > > >&)>’
91./boost/graph/stoer_wagner_min_cut.hpp: In instantiation of ‘typename boost::property_traits<ComponentMap>::value_type boost::detail::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’:
92./boost/graph/stoer_wagner_min_cut.hpp:198:68:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
93./boost/graph/stoer_wagner_min_cut.hpp:222:9:   required from ‘boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::operator()(const UndirectedGraph&, WeightMap, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type = int]’
94./boost/graph/stoer_wagner_min_cut.hpp:226:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::stoer_wagner_min_cut_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = int]’
95./boost/graph/stoer_wagner_min_cut.hpp:230:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::stoer_wagner_min_cut(const Param0&, const Param1&, const boost::bgl_named_params<P, T, R>&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; P = boost::associative_property_map<std::map<long unsigned int, bool> >; T = boost::parity_map_t; R = boost::bgl_named_params<boost::associative_property_map<std::map<long unsigned int, long unsigned int> >, boost::vertex_assignment_map_t, boost::no_property>; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type = int]’
96libs/graph/test/stoer_wagner_test.cpp:170:168:   required from here
97./boost/graph/maximum_adjacency_search.hpp:261:1: note: template<class Param0> typename boost::result_of<boost::graph::detail::maximum_adjacency_search_impl<Param0>(Param0, const boost::parameter::aux::empty_arg_list&)>::type boost::maximum_adjacency_search(const Param0&)
98./boost/graph/maximum_adjacency_search.hpp:261:1: note:   template argument deduction/substitution failed:
99In file included from libs/graph/test/stoer_wagner_test.cpp:16:0:
100./boost/graph/stoer_wagner_min_cut.hpp:163:7: note:   candidate expects 1 argument, 2 provided
101In file included from libs/graph/test/stoer_wagner_test.cpp:16:0:
102./boost/graph/stoer_wagner_min_cut.hpp: In instantiation of ‘boost::detail::mas_min_cut_visitor<ParityMap, WeightType, WeightMap>::mas_min_cut_visitor(ParityMap, WeightType&, const WeightMap&) [with ParityMap = boost::associative_property_map<std::map<int, bool> >; WeightType = int; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_weight_t, int>, boost::edge_weight_t>]’:
103./boost/graph/stoer_wagner_min_cut.hpp:142:44:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::detail::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int> >; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_weight_t, int>, boost::edge_weight_t>; ParityMap = boost::associative_property_map<std::map<int, bool> >; VertexAssignmentMap = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
104./boost/graph/stoer_wagner_min_cut.hpp:198:68:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int> >; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_weight_t, int>, boost::edge_weight_t>; ParityMap = boost::associative_property_map<std::map<int, bool> >; VertexAssignmentMap = boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
105./boost/graph/stoer_wagner_min_cut.hpp:222:9:   required from ‘boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::operator()(const UndirectedGraph&, WeightMap, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<int, bool> > >, boost::parameter::aux::empty_arg_list>; UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int> >; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_weight_t, int>, boost::edge_weight_t>; boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type = int]’
106./boost/graph/stoer_wagner_min_cut.hpp:226:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::stoer_wagner_min_cut_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int> >; Param1 = boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_weight_t, int>, boost::edge_weight_t>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<int, bool> > >, boost::parameter::aux::empty_arg_list>; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = int]’
107./boost/graph/stoer_wagner_min_cut.hpp:230:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::stoer_wagner_min_cut(const Param0&, const Param1&, const boost::bgl_named_params<P, T, R>&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int> >; Param1 = boost::adj_list_edge_property_map<boost::undirected_tag, int, int&, long unsigned int, boost::property<boost::edge_weight_t, int>, boost::edge_weight_t>; P = boost::associative_property_map<std::map<int, bool> >; T = boost::parity_map_t; R = boost::no_property; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type = int]’
108libs/graph/test/stoer_wagner_test.cpp:59:78:   required from here
109./boost/graph/stoer_wagner_min_cut.hpp:49:9: error: ‘class boost::associative_property_map<std::map<int, bool> >’ has no member named ‘data’
110./boost/graph/stoer_wagner_min_cut.hpp:49:9: error: ‘class boost::associative_property_map<std::map<int, bool> >’ has no member named ‘bits_per_char’
111./boost/graph/stoer_wagner_min_cut.hpp:49:9: error: ‘class boost::associative_property_map<std::map<int, bool> >’ has no member named ‘bits_per_char’
112./boost/graph/stoer_wagner_min_cut.hpp:49:9: error: ‘class boost::associative_property_map<std::map<int, bool> >’ has no member named ‘n’
113./boost/graph/stoer_wagner_min_cut.hpp: In instantiation of ‘boost::detail::mas_min_cut_visitor<ParityMap, WeightType, WeightMap>::mas_min_cut_visitor(ParityMap, WeightType&, const WeightMap&) [with ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; WeightType = int; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>]’:
114./boost/graph/stoer_wagner_min_cut.hpp:142:44:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::detail::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
115./boost/graph/stoer_wagner_min_cut.hpp:198:68:   required from ‘typename boost::property_traits<ComponentMap>::value_type boost::stoer_wagner_min_cut(const UndirectedGraph&, WeightMap, ParityMap, VertexAssignmentMap, KeyedUpdatablePriorityQueue&) [with UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ParityMap = boost::associative_property_map<std::map<long unsigned int, bool> >; VertexAssignmentMap = boost::associative_property_map<std::map<long unsigned int, long unsigned int> >; KeyedUpdatablePriorityQueue = boost::d_ary_heap_indirect<long unsigned int, 4ul, boost::shared_array_property_map<long unsigned int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, boost::shared_array_property_map<int, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >, std::greater<int>, std::vector<long unsigned int> >; typename boost::property_traits<ComponentMap>::value_type = int]’
116./boost/graph/stoer_wagner_min_cut.hpp:222:9:   required from ‘boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::operator()(const UndirectedGraph&, WeightMap, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; UndirectedGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; WeightMap = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; boost::graph::detail::stoer_wagner_min_cut_impl<UndirectedGraph, WeightMap>::result_type = int]’
117./boost/graph/stoer_wagner_min_cut.hpp:226:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type boost::graph::stoer_wagner_min_cut_with_named_params(const Param0&, const Param1&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::parity_map, const boost::associative_property_map<std::map<long unsigned int, bool> > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::vertex_assignment_map, const boost::associative_property_map<std::map<long unsigned int, long unsigned int> > >, boost::parameter::aux::empty_arg_list> >; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const ArgPack&)>::type = int]’
118./boost/graph/stoer_wagner_min_cut.hpp:230:1:   required from ‘typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type boost::stoer_wagner_min_cut(const Param0&, const Param1&, const boost::bgl_named_params<P, T, R>&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; Param1 = boost::constant_property_map<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, int>; P = boost::associative_property_map<std::map<long unsigned int, bool> >; T = boost::parity_map_t; R = boost::bgl_named_params<boost::associative_property_map<std::map<long unsigned int, long unsigned int> >, boost::vertex_assignment_map_t, boost::no_property>; typename boost::result_of<boost::graph::detail::stoer_wagner_min_cut_impl<Param0, Param1>(Param0, Param1, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<P, T, R> >::type&)>::type = int]’
119libs/graph/test/stoer_wagner_test.cpp:170:168:   required from here
120./boost/graph/stoer_wagner_min_cut.hpp:49:9: error: ‘class boost::associative_property_map<std::map<long unsigned int, bool> >’ has no member named ‘data’
121./boost/graph/stoer_wagner_min_cut.hpp:49:9: error: ‘class boost::associative_property_map<std::map<long unsigned int, bool> >’ has no member named ‘bits_per_char’
122./boost/graph/stoer_wagner_min_cut.hpp:49:9: error: ‘class boost::associative_property_map<std::map<long unsigned int, bool> >’ has no member named ‘bits_per_char’
123./boost/graph/stoer_wagner_min_cut.hpp:49:9: error: ‘class boost::associative_property_map<std::map<long unsigned int, bool> >’ has no member named ‘n’
124
125    "g++"  -ftemplate-depth-128 -O0 -fno-inline -Wall -g -fPIC  -DBOOST_ALL_NO_LIB=1 -DBOOST_TEST_NO_AUTO_LINK=1  -I"." -c -o "bin.v2/libs/graph/test/stoer_wagner_test.test/gcc-4.7.2/debug/stoer_wagner_test.o" "libs/graph/test/stoer_wagner_test.cpp"
126
127...failed gcc.compile.c++ bin.v2/libs/graph/test/stoer_wagner_test.test/gcc-4.7.2/debug/stoer_wagner_test.o...
128...skipped <pbin.v2/libs/graph/test/stoer_wagner_test.test/gcc-4.7.2/debug>stoer_wagner_test for lack of <pbin.v2/libs/graph/test/stoer_wagner_test.test/gcc-4.7.2/debug>stoer_wagner_test.o...
129...skipped <pbin.v2/libs/graph/test/stoer_wagner_test.test/gcc-4.7.2/debug>stoer_wagner_test.run for lack of <pbin.v2/libs/graph/test/stoer_wagner_test.test/gcc-4.7.2/debug>stoer_wagner_test...
130...failed updating 1 target...
131...skipped 3 targets...