make all-recursive make[1]: Entering directory `/scicomp/home/xei6/Desktop/graph-tool-2.26' Making all in src make[2]: Entering directory `/scicomp/home/xei6/Desktop/graph-tool-2.26/src' Making all in graph make[3]: Entering directory `/scicomp/home/xei6/Desktop/graph-tool-2.26/src/graph' Making all in centrality make[4]: Entering directory `/scicomp/home/xei6/Desktop/graph-tool-2.26/src/graph/centrality' CXX graph_betweenness.lo In file included from graph_betweenness.cc:21: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp: In instantiation of ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths > >]’: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:442:53: required from ‘void boost::brandes_betweenness_centrality(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; WeightMap = boost::unchecked_vector_property_map >]’ graph_betweenness.cc:130:13: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:336:22: error: call of overloaded ‘vertex(__gnu_cxx::__alloc_traits, long unsigned int>::value_type&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto s = vertex(pivots[i], g); ~~~~~~^~~~~~~~~~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from graph_betweenness.cc:21: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp: In instantiation of ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths > >]’: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:442:53: required from ‘void boost::brandes_betweenness_centrality(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; WeightMap = boost::unchecked_vector_property_map >]’ graph_betweenness.cc:130:13: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:336:22: error: call of overloaded ‘vertex(__gnu_cxx::__alloc_traits, long unsigned int>::value_type&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto s = vertex(pivots[i], g); ~~~~~~^~~~~~~~~~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from graph_betweenness.cc:21: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp: In instantiation of ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths > >]’: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:442:53: required from ‘void boost::brandes_betweenness_centrality(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; WeightMap = boost::unchecked_vector_property_map >]’ graph_betweenness.cc:130:13: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:336:22: error: call of overloaded ‘vertex(__gnu_cxx::__alloc_traits, long unsigned int>::value_type&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto s = vertex(pivots[i], g); ~~~~~~^~~~~~~~~~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from graph_betweenness.cc:21: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp: In instantiation of ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths > >]’: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:442:53: required from ‘void boost::brandes_betweenness_centrality(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; WeightMap = boost::unchecked_vector_property_map >]’ graph_betweenness.cc:130:13: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:336:22: error: call of overloaded ‘vertex(__gnu_cxx::__alloc_traits, long unsigned int>::value_type&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto s = vertex(pivots[i], g); ~~~~~~^~~~~~~~~~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from graph_betweenness.cc:21: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp: In instantiation of ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:415:53: required from ‘void boost::brandes_betweenness_centrality(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map]’ graph_betweenness.cc:95:13: required from ‘void get_betweenness::operator()(Graph&, std::vector&, graph_tool::GraphInterface::vertex_index_map_t, EdgeBetweenness, VertexBetweenness, bool, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; graph_tool::GraphInterface::vertex_index_map_t = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const bool&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const bool&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:583:17: required from ‘std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__enable_if_void<_Res> std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__call(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Res = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6}; _Result = void; _Functor = get_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int}; std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__enable_if_void<_Res> = void]’ /usr/local/include/c++/8.1.0/functional:661:24: required from ‘std::_Bind_result<_Result, _Functor(_Bound_args ...)>::result_type std::_Bind_result<_Result, _Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int}; std::_Bind_result<_Result, _Functor(_Bound_args ...)>::result_type = void]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:179:50: required from here ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:336:22: error: call of overloaded ‘vertex(__gnu_cxx::__alloc_traits, long unsigned int>::value_type&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto s = vertex(pivots[i], g); ~~~~~~^~~~~~~~~~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from graph_betweenness.cc:21: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp: In instantiation of ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:415:53: required from ‘void boost::brandes_betweenness_centrality(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map]’ graph_betweenness.cc:95:13: required from ‘void get_betweenness::operator()(Graph&, std::vector&, graph_tool::GraphInterface::vertex_index_map_t, EdgeBetweenness, VertexBetweenness, bool, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; graph_tool::GraphInterface::vertex_index_map_t = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const bool&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const bool&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:583:17: required from ‘std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__enable_if_void<_Res> std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__call(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Res = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6}; _Result = void; _Functor = get_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int}; std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__enable_if_void<_Res> = void]’ /usr/local/include/c++/8.1.0/functional:661:24: required from ‘std::_Bind_result<_Result, _Functor(_Bound_args ...)>::result_type std::_Bind_result<_Result, _Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int}; std::_Bind_result<_Result, _Functor(_Bound_args ...)>::result_type = void]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:179:50: required from here ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:336:22: error: call of overloaded ‘vertex(__gnu_cxx::__alloc_traits, long unsigned int>::value_type&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto s = vertex(pivots[i], g); ~~~~~~^~~~~~~~~~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from graph_betweenness.cc:21: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp: In instantiation of ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:415:53: required from ‘void boost::brandes_betweenness_centrality(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map]’ graph_betweenness.cc:95:13: required from ‘void get_betweenness::operator()(Graph&, std::vector&, graph_tool::GraphInterface::vertex_index_map_t, EdgeBetweenness, VertexBetweenness, bool, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; graph_tool::GraphInterface::vertex_index_map_t = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const bool&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const bool&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:583:17: required from ‘std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__enable_if_void<_Res> std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__call(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Res = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6}; _Result = void; _Functor = get_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int}; std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__enable_if_void<_Res> = void]’ /usr/local/include/c++/8.1.0/functional:661:24: required from ‘std::_Bind_result<_Result, _Functor(_Bound_args ...)>::result_type std::_Bind_result<_Result, _Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int}; std::_Bind_result<_Result, _Functor(_Bound_args ...)>::result_type = void]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:179:50: required from here ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:336:22: error: call of overloaded ‘vertex(__gnu_cxx::__alloc_traits, long unsigned int>::value_type&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto s = vertex(pivots[i], g); ~~~~~~^~~~~~~~~~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from graph_betweenness.cc:21: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp: In instantiation of ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; ShortestPaths = boost::detail::graph::brandes_unweighted_shortest_paths]’: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:415:53: required from ‘void boost::brandes_betweenness_centrality(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap) [with Graph = boost::reversed_graph, const boost::adj_list&>; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long double, long double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map]’ graph_betweenness.cc:95:13: required from ‘void get_betweenness::operator()(Graph&, std::vector&, graph_tool::GraphInterface::vertex_index_map_t, EdgeBetweenness, VertexBetweenness, bool, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; graph_tool::GraphInterface::vertex_index_map_t = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const bool&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const bool&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:583:17: required from ‘std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__enable_if_void<_Res> std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__call(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Res = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6}; _Result = void; _Functor = get_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int}; std::_Bind_result<_Result, _Functor(_Bound_args ...)>::__enable_if_void<_Res> = void]’ /usr/local/include/c++/8.1.0/functional:661:24: required from ‘std::_Bind_result<_Result, _Functor(_Bound_args ...)>::result_type std::_Bind_result<_Result, _Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int}; std::_Bind_result<_Result, _Functor(_Bound_args ...)>::result_type = void]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind_result, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, bool, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:179:50: required from here ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:336:22: error: call of overloaded ‘vertex(__gnu_cxx::__alloc_traits, long unsigned int>::value_type&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto s = vertex(pivots[i], g); ~~~~~~^~~~~~~~~~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:50, from graph_betweenness.cc:18: ../../../src/graph/graph_util.hh: In instantiation of ‘void graph_tool::parallel_vertex_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’: ../../../src/graph/graph_util.hh:200:55: required from ‘void graph_tool::parallel_vertex_loop(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ graph_betweenness.cc:60:9: required from ‘void normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]’ graph_betweenness.cc:137:34: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/graph/graph_util.hh:188:24: error: call of overloaded ‘vertex(size_t&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto v = vertex(i, g); ~~~~~~^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:50, from graph_betweenness.cc:18: ../../../src/graph/graph_util.hh: In instantiation of ‘void graph_tool::parallel_vertex_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’: ../../../src/graph/graph_util.hh:200:55: required from ‘void graph_tool::parallel_vertex_loop(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ graph_betweenness.cc:60:9: required from ‘void normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]’ graph_betweenness.cc:137:34: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/graph/graph_util.hh:188:24: error: call of overloaded ‘vertex(size_t&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto v = vertex(i, g); ~~~~~~^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:50, from graph_betweenness.cc:18: ../../../src/graph/graph_util.hh: In instantiation of ‘void graph_tool::parallel_vertex_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’: ../../../src/graph/graph_util.hh:200:55: required from ‘void graph_tool::parallel_vertex_loop(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ graph_betweenness.cc:60:9: required from ‘void normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]’ graph_betweenness.cc:137:34: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/graph/graph_util.hh:188:24: error: call of overloaded ‘vertex(size_t&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto v = vertex(i, g); ~~~~~~^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:50, from graph_betweenness.cc:18: ../../../src/graph/graph_util.hh: In instantiation of ‘void graph_tool::parallel_vertex_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’: ../../../src/graph/graph_util.hh:200:55: required from ‘void graph_tool::parallel_vertex_loop(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ graph_betweenness.cc:60:9: required from ‘void normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]’ graph_betweenness.cc:137:34: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/graph/graph_util.hh:188:24: error: call of overloaded ‘vertex(size_t&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto v = vertex(i, g); ~~~~~~^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:47, from graph_betweenness.cc:18: ../../../src/graph/graph_filtered.hh: In instantiation of ‘typename boost::filt_graph_base::vertex_descriptor boost::vertex(size_t, const boost::filt_graph&) [with G = boost::reversed_graph, const boost::adj_list&>; EP = graph_tool::detail::MaskFilter > >; VP = graph_tool::detail::MaskFilter > >; typename boost::filt_graph_base::vertex_descriptor = long unsigned int; size_t = long unsigned int]’: ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:336:22: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; ShortestPaths = boost::detail::graph::brandes_dijkstra_shortest_paths > >]’ ../../../src/boost-workaround/boost/graph/betweenness_centrality.hpp:442:53: required from ‘void boost::brandes_betweenness_centrality(const Graph&, std::vector&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap) [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; CentralityMap = boost::unchecked_vector_property_map >; EdgeCentralityMap = boost::unchecked_vector_property_map >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator, std::allocator > >*, std::vector, std::allocator > >, std::allocator, std::allocator > > > > >, boost::typed_identity_property_map, std::vector, std::allocator > >, std::vector, std::allocator > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator >, boost::typed_identity_property_map, long unsigned int, long unsigned int&>; VertexIndexMap = boost::typed_identity_property_map; WeightMap = boost::unchecked_vector_property_map >]’ graph_betweenness.cc:130:13: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > > >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > > >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/graph/graph_filtered.hh:339:20: error: call of overloaded ‘vertex(size_t&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto v = vertex(i, g._g); ~~~~~~^~~~~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:50, from graph_betweenness.cc:18: ../../../src/graph/graph_util.hh: In instantiation of ‘void graph_tool::parallel_vertex_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = graph_tool::parallel_edge_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]::&; long unsigned int thres = 300]’: ../../../src/graph/graph_util.hh:238:63: required from ‘void graph_tool::parallel_edge_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ ../../../src/graph/graph_util.hh:246:53: required from ‘void graph_tool::parallel_edge_loop(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ graph_betweenness.cc:70:9: required from ‘void normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]’ graph_betweenness.cc:137:34: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/graph/graph_util.hh:188:24: error: call of overloaded ‘vertex(size_t&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto v = vertex(i, g); ~~~~~~^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:50, from graph_betweenness.cc:18: ../../../src/graph/graph_util.hh: In instantiation of ‘void graph_tool::parallel_vertex_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = graph_tool::parallel_edge_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]::&; long unsigned int thres = 300]’: ../../../src/graph/graph_util.hh:238:63: required from ‘void graph_tool::parallel_edge_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ ../../../src/graph/graph_util.hh:246:53: required from ‘void graph_tool::parallel_edge_loop(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ graph_betweenness.cc:70:9: required from ‘void normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]’ graph_betweenness.cc:137:34: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/graph/graph_util.hh:188:24: error: call of overloaded ‘vertex(size_t&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto v = vertex(i, g); ~~~~~~^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:50, from graph_betweenness.cc:18: ../../../src/graph/graph_util.hh: In instantiation of ‘void graph_tool::parallel_vertex_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = graph_tool::parallel_edge_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]::&; long unsigned int thres = 300]’: ../../../src/graph/graph_util.hh:238:63: required from ‘void graph_tool::parallel_edge_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ ../../../src/graph/graph_util.hh:246:53: required from ‘void graph_tool::parallel_edge_loop(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ graph_betweenness.cc:70:9: required from ‘void normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]’ graph_betweenness.cc:137:34: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/graph/graph_util.hh:188:24: error: call of overloaded ‘vertex(size_t&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto v = vertex(i, g); ~~~~~~^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:50, from graph_betweenness.cc:18: ../../../src/graph/graph_util.hh: In instantiation of ‘void graph_tool::parallel_vertex_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = graph_tool::parallel_edge_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]::&; long unsigned int thres = 300]’: ../../../src/graph/graph_util.hh:238:63: required from ‘void graph_tool::parallel_edge_loop_no_spawn(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ ../../../src/graph/graph_util.hh:246:53: required from ‘void graph_tool::parallel_edge_loop(const Graph&, F&&) [with Graph = boost::reversed_graph, const boost::adj_list&>; F = normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]::; long unsigned int thres = 300]’ graph_betweenness.cc:70:9: required from ‘void normalize_betweenness(const Graph&, std::vector&, EdgeBetweenness, VertexBetweenness, size_t) [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; size_t = long unsigned int]’ graph_betweenness.cc:137:34: required from ‘void get_weighted_betweenness::operator()(Graph&, std::vector&, VertexIndexMap, EdgeBetweenness, VertexBetweenness, boost::any, bool, size_t, size_t) const [with Graph = boost::reversed_graph, const boost::adj_list&>; EdgeBetweenness = boost::unchecked_vector_property_map >; VertexBetweenness = boost::unchecked_vector_property_map >; VertexIndexMap = boost::typed_identity_property_map; size_t = long unsigned int]’ /usr/local/include/c++/8.1.0/bits/invoke.h:60:36: required from ‘constexpr _Res std::__invoke_impl(std::__invoke_other, _Fn&&, _Args&& ...) [with _Res = void; _Fn = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}]’ /usr/local/include/c++/8.1.0/bits/invoke.h:95:40: required from ‘constexpr typename std::__invoke_result<_Functor, _ArgTypes>::type std::__invoke(_Callable&&, _Args&& ...) [with _Callable = const get_weighted_betweenness&; _Args = {boost::reversed_graph, const boost::adj_list&>&, std::vector >&, const boost::typed_identity_property_map&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&, const boost::any&, const bool&, const long unsigned int&, const long unsigned int&}; typename std::__invoke_result<_Functor, _ArgTypes>::type = void]’ /usr/local/include/c++/8.1.0/functional:410:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; long unsigned int ..._Indexes = {0, 1, 2, 3, 4, 5, 6, 7, 8}; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ /usr/local/include/c++/8.1.0/functional:495:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reversed_graph, const boost::adj_list&>&, boost::unchecked_vector_property_map >&, boost::unchecked_vector_property_map >&}; _Result = void; _Functor = get_weighted_betweenness; _Bound_args = {std::_Placeholder<1>, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int}]’ ../../../src/graph/graph_filtering.hh:437:9: required from ‘void graph_tool::detail::action_wrap::operator()(Ts&& ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>&, boost::checked_vector_property_map >&, boost::checked_vector_property_map >&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_]’ ../../../src/graph/mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast::dispatch(std::index_sequence, Ts* ...) const [with long unsigned int ...Idx = {0, 1, 2}; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3; std::index_sequence = std::integer_sequence]’ ../../../src/graph/mpl_nested_loop.hh:77:9: required from ‘void boost::mpl::all_any_cast::operator()(Ts* ...) const [with Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >, boost::checked_vector_property_map >}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; long unsigned int N = 3]’ ../../../src/graph/mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop >::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&>, boost::checked_vector_property_map > > >; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::checked_vector_property_map >; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {boost::reversed_graph, const boost::adj_list&>}; TR1 = graph_tool::vertex_floating_properties; TRS = {}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]:: [with auto:24 = boost::checked_vector_property_map >*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple, const boost::adj_list&> >, graph_tool::vertex_floating_properties>; Ts = {boost::checked_vector_property_map >, boost::checked_vector_property_map >}]’ ../../../src/graph/mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop, TR1, TRS ...>::operator()(T*) const [with T = boost::reversed_graph, const boost::adj_list&>; Action = boost::mpl::all_any_cast, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>; Ts = {}; TR1 = graph_tool::edge_floating_properties; TRS = {graph_tool::vertex_floating_properties}]’ ../../../src/graph/mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]:: [with auto:24 = boost::reversed_graph, const boost::adj_list&>*]’ ../../../src/graph/mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic >::operator()(F) [with F = boost::mpl::inner_loop, std::reference_wrapper > >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >, 3>, std::tuple<>, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties>; Ts = {boost::adj_list, boost::reversed_graph, const boost::adj_list&>, boost::undirected_adaptor >, boost::filt_graph, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph, const boost::adj_list&>, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >, boost::filt_graph >, graph_tool::detail::MaskFilter > >, graph_tool::detail::MaskFilter > > >}]’ ../../../src/graph/mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::all_graph_views; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; Action = graph_tool::detail::action_wrap, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>, mpl_::bool_ >; Args = {boost::any, boost::any&, boost::any&}]’ ../../../src/graph/graph_filtering.hh:455:48: required from ‘void graph_tool::detail::action_dispatch::operator()(Args&& ...) const [with Args = {boost::any, boost::any&, boost::any&}; Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; Wrap = mpl_::bool_; TRS = {graph_tool::detail::all_graph_views, graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}]’ ../../../src/graph/graph_filtering.hh:476:63: required from ‘graph_tool::run_action::operator()(graph_tool::GraphInterface&, Action, TRS ...) [with Action = std::_Bind, std::reference_wrapper >, boost::typed_identity_property_map, std::_Placeholder<2>, std::_Placeholder<3>, boost::any, bool, long unsigned int, long unsigned int)>; TRS = {graph_tool::edge_floating_properties, graph_tool::vertex_floating_properties}; GraphViews = graph_tool::detail::all_graph_views; Wrap = mpl_::bool_]:: [with auto:25 = {boost::any&, boost::any&}]’ graph_betweenness.cc:167:50: required from here ../../../src/graph/graph_util.hh:188:24: error: call of overloaded ‘vertex(size_t&, const boost::reversed_graph, const boost::adj_list&>&)’ is ambiguous auto v = vertex(i, g); ~~~~~~^~~~~~ In file included from ../../../src/graph/graph_filtering.hh:48, from graph_betweenness.cc:18: ../../../src/graph/graph_reverse.hh:172:1: note: candidate: ‘typename boost::graph_traits::vertex_descriptor boost::vertex(typename boost::graph_traits::vertices_size_type, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits::vertex_descriptor = long unsigned int; typename boost::graph_traits::vertices_size_type = long unsigned int]’ vertex(const typename graph_traits::vertices_size_type v, ^~~~~~ ../../../src/graph/graph_reverse.hh:279:1: note: candidate: ‘typename boost::graph_traits >::vertex_descriptor boost::vertex(size_t, const boost::reversed_graph&) [with BidirectionalGraph = boost::adj_list; GRef = const boost::adj_list&; typename boost::graph_traits >::vertex_descriptor = long unsigned int; size_t = long unsigned int]’ vertex(size_t i, const reversed_graph& g) ^~~~~~ make[4]: *** [graph_betweenness.lo] Error 1 make[4]: Leaving directory `/scicomp/home/xei6/Desktop/graph-tool-2.26/src/graph/centrality' make[3]: *** [all-recursive] Error 1 make[3]: Leaving directory `/scicomp/home/xei6/Desktop/graph-tool-2.26/src/graph' make[2]: *** [all-recursive] Error 1 make[2]: Leaving directory `/scicomp/home/xei6/Desktop/graph-tool-2.26/src' make[1]: *** [all-recursive] Error 1 make[1]: Leaving directory `/scicomp/home/xei6/Desktop/graph-tool-2.26' make: *** [all] Error 2