Compiler error on CentOS 7 with graph-tool-2.18, gcc 5.4.0, boost_1_62_0, CGAL-4.9 in file graph_concepts.hpp
Hitting this make error with the latest version of everything.
Configure command:
./configure --with-sparsehash-prefix=google --with-boost=/usr/local/boost --with-boost-libdir=/usr/local/boost/stage/lib CPPFLAGS="-I/usr/local/boost" LDFLAGS="-L/usr/local/boost/stage/lib"
This is also with this CGAL patch: 2a4aa1fb
Error and error file attached:
/usr/local/boost/boost/graph/graph_concepts.hpp:131:19: error: no matching function for call to ‘degree(boost::graph_traits<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > > >::vertex_descriptor&, boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&)’
n = degree(v, g);
^
In file included from ./../graph.hh:28:0,
from ./../graph_filtering.hh:21,
from graph_dominator_tree.cc:18:
./../graph_adjacency.hh:621:8: note: candidate: template<class Vertex> size_t boost::degree(Vertex, const boost::adj_list<Vertex>&)
size_t degree(Vertex v, const adj_list<Vertex>& g)
^
./../graph_adjacency.hh:621:8: note: template argument deduction/substitution failed:
In file included from /usr/local/boost/boost/graph/depth_first_search.hpp:18:0,
from /usr/local/boost/boost/graph/dominator_tree.hpp:15,
from graph_dominator_tree.cc:22:
/usr/local/boost/boost/graph/graph_concepts.hpp:131:19: note: ‘boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >’ is not derived from ‘const boost::adj_list<Vertex>’
n = degree(v, g);
^
In file included from ./../hash_map_wrap.hh:30:0,
from ./../graph_properties.hh:47,
from ./../graph.hh:35,
from ./../graph_filtering.hh:21,
from graph_dominator_tree.cc:18:
./../../boost-workaround/boost/graph/reverse_graph_alt.hpp:289:1: note: candidate: template<class BidirectionalGraph, class GRef> typename boost::graph_traits<G>::degree_size_type boost::degree(typename boost::graph_traits<Graph>::vertex_descriptor, const boost::reverse_graph<BidirectionalGraph, GraphRef>&)
degree(const typename graph_traits<BidirectionalGraph>::vertex_descriptor u,
^
./../../boost-workaround/boost/graph/reverse_graph_alt.hpp:289:1: note: template argument deduction/substitution failed:
In file included from /usr/local/boost/boost/graph/depth_first_search.hpp:18:0,
from /usr/local/boost/boost/graph/dominator_tree.hpp:15,
from graph_dominator_tree.cc:22:
/usr/local/boost/boost/graph/graph_concepts.hpp:131:19: note: ‘boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >’ is not derived from ‘const boost::reverse_graph<BidirectionalGraph, GraphRef>’
n = degree(v, g);
^
In file included from ./../graph_filtering.hh:48:0,
from graph_dominator_tree.cc:18:
./../graph_adaptor.hh:539:1: note: candidate: template<class Graph> typename boost::graph_traits<boost::UndirectedAdaptor<Graph> >::degree_size_type boost::degree(typename boost::graph_traits<boost::UndirectedAdaptor<Graph> >::vertex_descriptor, const boost::UndirectedAdaptor<Graph>&)
degree(typename graph_traits<UndirectedAdaptor<Graph> >::vertex_descriptor u,
^
./../graph_adaptor.hh:539:1: note: template argument deduction/substitution failed:
In file included from /usr/local/boost/boost/graph/depth_first_search.hpp:18:0,
from /usr/local/boost/boost/graph/dominator_tree.hpp:15,
from graph_dominator_tree.cc:22:
/usr/local/boost/boost/graph/graph_concepts.hpp:131:19: note: ‘boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >’ is not derived from ‘const boost::UndirectedAdaptor<Graph>’
n = degree(v, g);
^
In file included from ./../hash_map_wrap.hh:30:0,
from ./../graph_properties.hh:47,
from ./../graph.hh:35,
from ./../graph_filtering.hh:21,
from graph_dominator_tree.cc:18:
./../../boost-workaround/boost/graph/reverse_graph_alt.hpp: In instantiation of ‘typename boost::graph_traits<G>::degree_size_type boost::degree(typename boost::graph_traits<Graph>::vertex_descriptor, const boost::reverse_graph<BidirectionalGraph, GraphRef>&) [with BidirectionalGraph = boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >; GRef = const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&; typename boost::graph_traits<G>::degree_size_type = long unsigned int; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’:
/usr/local/boost/boost/graph/graph_concepts.hpp:131:19: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>]’
/usr/local/boost/boost/graph/graph_concepts.hpp:114:5: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&> >]’
/usr/local/boost/boost/graph/dominator_tree.hpp:250:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::typed_identity_property_map<long unsigned int>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::typed_identity_property_map<long unsigned int>, long unsigned int, long unsigned int&>; VertexVector = std::vector<long unsigned int, std::allocator<long unsigned int> >; DomTreePredMap = boost::unchecked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
/usr/local/boost/boost/graph/dominator_tree.hpp:369:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename boost::graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>; DomTreePredMap = boost::unchecked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
graph_dominator_tree.cc:33:39: required from ‘void get_dominator_tree::operator()(const Graph&, size_t, PredMap) const [with Graph = boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>; PredMap = boost::unchecked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >; size_t = long unsigned int]’
/usr/local/include/c++/5.4.0/functional:1083:55: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::__call_c(std::tuple<_Args2 ...>&&, std::_Index_tuple<_Indexes ...>) const [with _Result = void; _Args = {boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>&, boost::unchecked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >&}; long unsigned int ..._Indexes = {0ul, 1ul, 2ul}; _Functor = get_dominator_tree; _Bound_args = {std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>}]’
/usr/local/include/c++/5.4.0/functional:1147:24: required from ‘_Result std::_Bind<_Functor(_Bound_args ...)>::operator()(_Args&& ...) const [with _Args = {boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>&, boost::unchecked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >&}; _Result = void; _Functor = get_dominator_tree; _Bound_args = {std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>}]’
./../graph_filtering.hh:432:9: required from ‘void graph_tool::detail::action_wrap<Action, Wrap>::operator()(Ts&& ...) const [with Ts = {boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>&, boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >&}; Action = std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>; Wrap = mpl_::bool_<false>]’
./../mpl_nested_loop.hh:110:13: required from ‘void boost::mpl::all_any_cast<Action, N>::dispatch(std::index_sequence<Idx ...>, Ts* ...) const [with long unsigned int ...Idx = {0ul, 1ul}; Ts = {boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>, boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >}; Action = graph_tool::detail::action_wrap<std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>, mpl_::bool_<false> >; long unsigned int N = 2ul; std::index_sequence<Idx ...> = std::integer_sequence<long unsigned int, 0ul, 1ul>]’
./../mpl_nested_loop.hh:77:17: required from ‘void boost::mpl::all_any_cast<Action, N>::operator()(Ts* ...) const [with Ts = {boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>, boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >}; Action = graph_tool::detail::action_wrap<std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>, mpl_::bool_<false> >; long unsigned int N = 2ul]’
./../mpl_nested_loop.hh:164:7: required from ‘void boost::mpl::inner_loop<Action, std::tuple<_Elements ...> >::operator()(T*) const [with T = boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >; Action = boost::mpl::all_any_cast<graph_tool::detail::action_wrap<std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>, mpl_::bool_<false> >, 2ul>; Ts = {boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>}]’
./../mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic<F, std::tuple<_Elements ...> >::operator()(F)::<lambda(auto:25&&)> [with auto:25 = boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >*; F = boost::mpl::inner_loop<boost::mpl::all_any_cast<graph_tool::detail::action_wrap<std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>, mpl_::bool_<false> >, 2ul>, std::tuple<boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&> > >; Ts = {boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >}]’
./../mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic<F, std::tuple<_Elements ...> >::operator()(F) [with F = boost::mpl::inner_loop<boost::mpl::all_any_cast<graph_tool::detail::action_wrap<std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>, mpl_::bool_<false> >, 2ul>, std::tuple<boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&> > >; Ts = {boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >}]’
./../mpl_nested_loop.hh:180:52: required from ‘void boost::mpl::inner_loop<Action, std::tuple<_Elements ...>, TR1, TRS ...>::operator()(T*) const [with T = boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>; Action = boost::mpl::all_any_cast<graph_tool::detail::action_wrap<std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>, mpl_::bool_<false> >, 2ul>; Ts = {}; TR1 = boost::mpl::v_item<boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>; TRS = {}]’
./../mpl_nested_loop.hh:129:38: required from ‘boost::mpl::for_each_variadic<F, std::tuple<_Elements ...> >::operator()(F)::<lambda(auto:25&&)> [with auto:25 = boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>*; F = boost::mpl::inner_loop<boost::mpl::all_any_cast<graph_tool::detail::action_wrap<std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>, mpl_::bool_<false> >, 2ul>, std::tuple<>, boost::mpl::v_item<boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0> >; Ts = {boost::adj_list<long unsigned int>, boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, boost::reverse_graph<boost::adj_list<long unsigned int>, const boost::adj_list<long unsigned int>&>, boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>}]’
./../mpl_nested_loop.hh:130:48: required from ‘void boost::mpl::for_each_variadic<F, std::tuple<_Elements ...> >::operator()(F) [with F = boost::mpl::inner_loop<boost::mpl::all_any_cast<graph_tool::detail::action_wrap<std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>, mpl_::bool_<false> >, 2ul>, std::tuple<>, boost::mpl::v_item<boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0> >; Ts = {boost::adj_list<long unsigned int>, boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, boost::reverse_graph<boost::adj_list<long unsigned int>, const boost::adj_list<long unsigned int>&>, boost::reverse_graph<boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&>}]’
./../mpl_nested_loop.hh:197:52: required from ‘bool boost::mpl::nested_for_each(Action, Args&& ...) [with TR1 = graph_tool::detail::always_directed; TRS = {boost::mpl::v_item<boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>}; Action = graph_tool::detail::action_wrap<std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>, mpl_::bool_<false> >; Args = {boost::any, boost::any&}]’
./../graph_filtering.hh:450:48: required from ‘void graph_tool::detail::action_dispatch<Action, Wrap, TRS>::operator()(Args&& ...) const [with Args = {boost::any, boost::any&}; Action = std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>; Wrap = mpl_::bool_<false>; TRS = {graph_tool::detail::always_directed, boost::mpl::v_item<boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>}]’
./../graph_filtering.hh:471:63: required from ‘graph_tool::run_action<GraphViews, Wrap>::operator()(graph_tool::GraphInterface&, Action, TRS ...)::<lambda(auto:26&& ...)> [with auto:26 = {boost::any&}; Action = std::_Bind<get_dominator_tree(std::_Placeholder<1>, long unsigned int, std::_Placeholder<2>)>; TRS = {boost::mpl::v_item<boost::checked_vector_property_map<int, boost::typed_identity_property_map<long unsigned int> >, boost::mpl::vector0<mpl_::na>, 0>}; GraphViews = graph_tool::detail::always_directed; Wrap = mpl_::bool_<false>]’
graph_dominator_tree.cc:47:37: required from here
./../../boost-workaround/boost/graph/reverse_graph_alt.hpp:292:18: error: no matching function for call to ‘degree(const vertex_descriptor&, const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >&)’
return degree(u, g.m_g);
^
In file included from ./../graph.hh:28:0,
from ./../graph_filtering.hh:21,
from graph_dominator_tree.cc:18:
./../graph_adjacency.hh:621:8: note: candidate: template<class Vertex> size_t boost::degree(Vertex, const boost::adj_list<Vertex>&)
size_t degree(Vertex v, const adj_list<Vertex>& g)
^
./../graph_adjacency.hh:621:8: note: template argument deduction/substitution failed:
In file included from ./../hash_map_wrap.hh:30:0,
from ./../graph_properties.hh:47,
from ./../graph.hh:35,
from ./../graph_filtering.hh:21,
from graph_dominator_tree.cc:18:
./../../boost-workaround/boost/graph/reverse_graph_alt.hpp:292:18: note: ‘const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >’ is not derived from ‘const boost::adj_list<Vertex>’
return degree(u, g.m_g);
^
./../../boost-workaround/boost/graph/reverse_graph_alt.hpp:289:1: note: candidate: template<class BidirectionalGraph, class GRef> typename boost::graph_traits<G>::degree_size_type boost::degree(typename boost::graph_traits<Graph>::vertex_descriptor, const boost::reverse_graph<BidirectionalGraph, GraphRef>&)
degree(const typename graph_traits<BidirectionalGraph>::vertex_descriptor u,
^
./../../boost-workaround/boost/graph/reverse_graph_alt.hpp:289:1: note: template argument deduction/substitution failed:
./../../boost-workaround/boost/graph/reverse_graph_alt.hpp:292:18: note: ‘const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >’ is not derived from ‘const boost::reverse_graph<BidirectionalGraph, GraphRef>’
return degree(u, g.m_g);
^
In file included from ./../graph_filtering.hh:48:0,
from graph_dominator_tree.cc:18:
./../graph_adaptor.hh:539:1: note: candidate: template<class Graph> typename boost::graph_traits<boost::UndirectedAdaptor<Graph> >::degree_size_type boost::degree(typename boost::graph_traits<boost::UndirectedAdaptor<Graph> >::vertex_descriptor, const boost::UndirectedAdaptor<Graph>&)
degree(typename graph_traits<UndirectedAdaptor<Graph> >::vertex_descriptor u,
^
./../graph_adaptor.hh:539:1: note: template argument deduction/substitution failed:
In file included from ./../hash_map_wrap.hh:30:0,
from ./../graph_properties.hh:47,
from ./../graph.hh:35,
from ./../graph_filtering.hh:21,
from graph_dominator_tree.cc:18:
./../../boost-workaround/boost/graph/reverse_graph_alt.hpp:292:18: note: ‘const boost::filtered_graph<boost::adj_list<long unsigned int>, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::adj_edge_index_property_map<long unsigned int> > >, graph_tool::detail::MaskFilter<boost::unchecked_vector_property_map<unsigned char, boost::typed_identity_property_map<long unsigned int> > > >’ is not derived from ‘const boost::UndirectedAdaptor<Graph>’
return degree(u, g.m_g);
^
make[4]: *** [graph_dominator_tree.lo] Error 1
make[4]: Leaving directory `/home/username/Downloads/graph-tool-2.18/src/graph/topology'