Advertisement
Guest User

edmond_karp_named_parameters

a guest
Jun 3rd, 2015
357
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 10.83 KB | None | 0 0
  1. 14:44:12 **** Incremental Build of configuration Debug for project graph-boost ****
  2. make all
  3. Building file: ../essai.cpp
  4. Invoking: Cross G++ Compiler
  5. g++-5 -I/home/maelv/cpp/boost_1_58_0/include -O0 -g3 -Wall -c -fmessage-length=0 -Wdeprecated-declarations -MMD -MP -MF"essai.d" -MT"essai.d" -o "essai.o" "../essai.cpp"
  6. In file included from /home/maelv/cpp/boost_1_58_0/include/boost/graph/adjacency_list.hpp:246:0,
  7.                  from ../essai.cpp:12:
  8. /home/maelv/cpp/boost_1_58_0/include/boost/graph/detail/adjacency_list.hpp: In instantiation of ‘struct boost::detail::adj_list_any_edge_pmap::bind_<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>, edge_t, boost::edge_capacity_t>:
  9. /home/maelv/cpp/boost_1_58_0/include/boost/graph/detail/adjacency_list.hpp:2728:12:   required from ‘struct boost::detail::adj_list_choose_edge_pmap<boost::edge_capacity_t, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>, edge_t>
  10. /home/maelv/cpp/boost_1_58_0/include/boost/graph/detail/adjacency_list.hpp:2733:14:   required from ‘struct boost::detail::adj_list_edge_property_selector::bind_<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>, edge_t, boost::edge_capacity_t>
  11. /home/maelv/cpp/boost_1_58_0/include/boost/graph/properties.hpp:192:12:   required from ‘struct boost::detail::edge_property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>, boost::edge_capacity_t>
  12. /home/maelv/cpp/boost_1_58_0/include/boost/graph/properties.hpp:212:10:   required from ‘struct boost::property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>, boost::edge_capacity_t, void>
  13. /home/maelv/cpp/boost_1_58_0/include/boost/mpl/eval_if.hpp:38:31:   recursively required from ‘struct boost::mpl::eval_if<mpl_::bool_<true>, boost::detail::const_type_as_type<boost::property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>, boost::edge_capacity_t, void> >, boost::property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>, boost::edge_capacity_t, void> >
  14. /home/maelv/cpp/boost_1_58_0/include/boost/mpl/eval_if.hpp:38:31:   required from ‘struct boost::mpl::eval_if<boost::is_same<boost::param_not_found, boost::param_not_found>, boost::mpl::eval_if<mpl_::bool_<true>, boost::detail::const_type_as_type<boost::property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>, boost::edge_capacity_t, void> >, boost::property_map<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>, boost::edge_capacity_t, void> >, boost::mpl::identity<boost::param_not_found> >
  15. /home/maelv/cpp/boost_1_58_0/include/boost/graph/named_function_params.hpp:269:12:   required from ‘struct boost::detail::choose_impl_result<mpl_::bool_<true>, boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>, boost::param_not_found, boost::edge_capacity_t>
  16. /home/maelv/cpp/boost_1_58_0/include/boost/graph/named_function_params.hpp:326:156:   required from ‘struct boost::detail::edge_capacity_value<boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::default_color_type*, boost::vertex_color_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, edge_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> edge_t::*>, boost::edge_reverse_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, float, float&, long unsigned int, edge_t, float edge_t::*>, boost::edge_residual_capacity_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, edge_t, double edge_t::*>, boost::edge_capacity_t, boost::no_property> > > > >
  17. /home/maelv/cpp/boost_1_58_0/include/boost/graph/edmonds_karp_max_flow.hpp:223:3:   required by substitution of ‘template<class Graph, class P, class T, class R> typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&) [with Graph = boost::adjacency_list<boost::listS, boost::vecS, boost::directedS, node_t, edge_t>; P = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*; T = boost::vertex_predecessor_t; R = boost::bgl_named_params<boost::default_color_type*, boost::vertex_color_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, edge_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> edge_t::*>, boost::edge_reverse_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, float, float&, long unsigned int, edge_t, float edge_t::*>, boost::edge_residual_capacity_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, edge_t, double edge_t::*>, boost::edge_capacity_t, boost::no_property> > > >]
  18. ../essai.cpp:86:174:   required from here
  19. /home/maelv/cpp/boost_1_58_0/include/boost/graph/detail/adjacency_list.hpp:2696:29: error: forming reference to void
  20.          typedef value_type& reference;
  21.                              ^
  22. /home/maelv/cpp/boost_1_58_0/include/boost/graph/detail/adjacency_list.hpp:2697:35: error: forming reference to void
  23.          typedef const value_type& const_reference;
  24.                                    ^
  25. /home/maelv/cpp/boost_1_58_0/include/boost/graph/detail/adjacency_list.hpp:2701:61: error: forming reference to void
  26.              typename Graph::vertex_descriptor,Property,Tag> type;
  27.                                                              ^
  28. /home/maelv/cpp/boost_1_58_0/include/boost/graph/detail/adjacency_list.hpp:2704:68: error: forming reference to void
  29.              typename Graph::vertex_descriptor,const Property, Tag> const_type;
  30.                                                                     ^
  31. ../essai.cpp: In function ‘int main():
  32. ../essai.cpp:86:174: error: no matching function for call to ‘edmonds_karp_max_flow(Graph&, boost::adjacency_list_traits<boost::vecS, boost::vecS, boost::directedS>::vertex_descriptor&, boost::adjacency_list_traits<boost::vecS, boost::vecS, boost::directedS>::vertex_descriptor&, boost::bgl_named_params<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::vertex_predecessor_t, boost::bgl_named_params<boost::default_color_type*, boost::vertex_color_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&, long unsigned int, edge_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> edge_t::*>, boost::edge_reverse_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, float, float&, long unsigned int, edge_t, float edge_t::*>, boost::edge_residual_capacity_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, edge_t, double edge_t::*>, boost::edge_capacity_t, boost::no_property> > > > >)
  33.   long flow = edmonds_karp_max_flow(g, s, t,capacity_map(capacity).residual_capacity_map(residual_capacity).reverse_edge_map(rev).color_map(&col[0]).predecessor_map(&pred[0]));
  34.                                                                                                                                                                               ^
  35. In file included from ../essai.cpp:11:0:
  36. /home/maelv/cpp/boost_1_58_0/include/boost/graph/edmonds_karp_max_flow.hpp:79:3: note: candidate: template<class Graph, class CapacityEdgeMap, class ResidualCapacityEdgeMap, class ReverseEdgeMap, class ColorMap, class PredEdgeMap> typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap)
  37.    edmonds_karp_max_flow
  38.    ^
  39. /home/maelv/cpp/boost_1_58_0/include/boost/graph/edmonds_karp_max_flow.hpp:79:3: note:   template argument deduction/substitution failed:
  40. ../essai.cpp:86:174: note:   candidate expects 8 arguments, 4 provided
  41.   long flow = edmonds_karp_max_flow(g, s, t,capacity_map(capacity).residual_capacity_map(residual_capacity).reverse_edge_map(rev).color_map(&col[0]).predecessor_map(&pred[0]));
  42.                                                                                                                                                                               ^
  43. In file included from ../essai.cpp:11:0:
  44. /home/maelv/cpp/boost_1_58_0/include/boost/graph/edmonds_karp_max_flow.hpp:223:3: note: candidate: template<class Graph, class P, class T, class R> typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&)
  45.    edmonds_karp_max_flow
  46.    ^
  47. /home/maelv/cpp/boost_1_58_0/include/boost/graph/edmonds_karp_max_flow.hpp:223:3: note:   substitution of deduced template arguments resulted in errors seen above
  48. /home/maelv/cpp/boost_1_58_0/include/boost/graph/edmonds_karp_max_flow.hpp:238:3: note: candidate: template<class Graph> typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor)
  49.    edmonds_karp_max_flow
  50.    ^
  51. /home/maelv/cpp/boost_1_58_0/include/boost/graph/edmonds_karp_max_flow.hpp:238:3: note:   template argument deduction/substitution failed:
  52. ../essai.cpp:86:174: note:   candidate expects 3 arguments, 4 provided
  53.   long flow = edmonds_karp_max_flow(g, s, t,capacity_map(capacity).residual_capacity_map(residual_capacity).reverse_edge_map(rev).color_map(&col[0]).predecessor_map(&pred[0]));
  54.                                                                                                                                                                               ^
  55. make: *** [essai.o] Error 1
  56.  
  57. 14:44:15 Build Finished (took 2s.628ms)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement